Professional Documents
Culture Documents
ch2 MCQ 11e
ch2 MCQ 11e
ch2 MCQ 11e
1) Linear programming is a model consisting of linear relationships representing a firm's decisions given
an objective and resource constraints.
Answer: TR!
"iff: # $age Ref: %1
&ection eading: (odel ormulation
*e+words: model formulation
AA,&-: Anal+tic sills
#) The objective function alwa+s consists of either ma/imi0ing or minimi0ing some value.
Answer: TR!
"iff: # $age Ref: %1
&ection eading: (odel ormulation
*e+words: objective function
AA,&-: Anal+tic sills
1
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
8) A feasible solution violates at least one of the constraints.
Answer: AL&!
"iff: # $age Ref: %
&ection eading: (odel ormulation
*e+words: model formulation
AA,&-: Anal+tic sills
9) $roportionalit+ means the slope of a constraint is proportional to the slope of the objective function.
Answer: AL&!
"iff: # $age Ref: 23
&ection eading: ,haracteristics of Linear $rogramming $roblems
*e+words: properties of linear programming models6 proportionalit+
AA,&-: Anal+tic sills
#
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
1) All linear programming models e/hibit a set of constraints.
Answer: TR!
"iff: 1 $age Ref: %5
&ection eading: (odel ormulation
*e+words: properties of linear programming models6 constraints
AA,&-: Anal+tic sills
12) ;hen using the graphical method6 onl+ one of the four <uadrants of an xy=a/is needs to be drawn.
Answer: TR!
"iff: 1 $age Ref: %3
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical linear programming
AA,&-: Anal+tic sills
13) Linear programming models e/hibit linearit+ among all constraint relationships and the objective
function.
Answer: TR!
"iff: 1 $age Ref: 22
&ection eading: ,haracteristics of Linear $rogramming $roblems
*e+words: properties of linear prog models6 linearit+6 proportionalit+
AA,&-: Anal+tic sills
18) The e<uation 9xy ? %# satisfies the proportionalit+ propert+ of linear programming.
Answer: AL&!
"iff: # $age Ref: 23
&ection eading: ,haracteristics of Linear $rogramming $roblems
*e+words: graphical solution6 proportionalit+
AA,&-: Anal+tic sills
19) T+picall+6 finding a corner point for the feasible region involves solving a set of three simultaneous
e<uations.
Answer: AL&!
"iff: # $age Ref: 3
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical solution6 e/treme points6 feasible region
AA,&-: Anal+tic sills
#5) The feasible solution area contains infinite solutions to the linear program.
Answer: TR!
"iff: 1 $age Ref: %9
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: properties of linear programming models6 feasible solution area
AA,&-: Anal+tic sills
%
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
#1) There is e/actl+ one optimal solution point to a linear program.
Answer: AL&!
"iff: # $age Ref: 2%
&ection eading: 7rregular T+pes of Linear $rogramming $roblems
*e+words: properties of linear programming models6 optimal solution pt
AA,&-: Anal+tic sills
##) The following e<uation represents a resource constraint for a ma/imi0ation problem: B C D #5.
Answer: AL&!
"iff: # $age Ref: %
&ection eading: A (a/imi0ation (odel !/ample
*e+words: properties of linear programming models6 constraints
AA,&-: Anal+tic sills
#%) The optimal solution for a graphical linear programming problem is the corner point that is the
farthest from the srcin.
Answer: AL&!
"iff: # $age Ref: 1
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: feasibilit+6 constraints
AA,&-: Anal+tic sills
#2) 7n the graphical approach6 simultaneous e<uations ma+ be used to solve for the optimal solution
point.
Answer: TR!
"iff: # $age Ref: #
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical solution
AA,&-: Anal+tic sills
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
#8) &urplus variables are onl+ associated with minimi0ation problems.
Answer: AL&!
"iff: # $age Ref: 2#
&ection eading: A (inimi0ation (odel !/ample
*e+words: graphical solution6 surplus variable
AA,&-: Anal+tic sills
#) (ultiple optimal solutions occur when constraints are parallel to each other.
Answer: AL&!
"iff: # $age Ref: 2
&ection eading: 7rregular T+pes of Linear $rogramming $roblems
*e+words: graphical solution
AA,&-: Anal+tic sills
%5) >raphical solutions to linear programming problems have an infinite number of possible objective
function lines.
Answer: TR!
"iff: # $age Ref: %
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical solution6 objective function line
AA,&-: Anal+tic sills
%1) The first step in formulating a linear programming model is to define the objective function
Answer: AL&!
"iff: # $age Ref: %#
&ection eading: 7ntroduction
*e+words: linear programming problems6 formulation
AA,&-: Anal+tic sills
2
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
%) A EEEEEEEE is a linear relationship representing a restriction on decision maing.
Answer: constraint
"iff: 1 $age Ref: %1
&ection eading: (odel ormulation
*e+words: constraint6 model formulation
AA,&-: Anal+tic sills
%2) A manufacturer using linear programming to decide the best product mi/ to ma/imi0e profit
t+picall+ has aFn) EEEEEEEE constraint included in the model.
Answer: nonnegativit+
"iff: 1 $age Ref: %
&ection eading: A (a/imi0ation (odel !/ample
*e+words: nonnegativit+
AA,&-: Anal+tic sills
%3) 7f at least one constraint in a linear programming model is violated6 the solution is said to be
EEEEEEEE.
Answer: infeasible
"iff: 1 $age Ref: 2
&ection eading: 7rregular T+pes of Linear $rogramming $roblems
*e+words: constraint6 infeasible solution
AA,&-: Anal+tic sills
%8) A graphical solution is limited to solving linear programming problems with EEEEEEEE decision
variables
Answer: two
"iff: 1 $age Ref: %2
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical solution
AA,&-: Anal+tic sills
%9) The EEEEEEEE solution area is an area bounded b+ the constraint e<uations.
Answer: feasible
"iff: 1 $age Ref: %9
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical solution
AA,&-: Anal+tic sills
%) (ultiple optimal solutions can occur when the objective function line is EEEEEEEE to a constraint
line.
Answer: parallel
"iff: # $age Ref:
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical solution6 multiple optimal solutions
AA,&-: Anal+tic sills
3
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
5) ;hen a ma/imi0ation problem is EEEEEEEE6 the objective function can increase indefinitel+ without
reaching a ma/imum value.
Answer: unbounded
"iff: # $age Ref: 22
&ection eading: 7rregular T+pes of Linear $rogramming $roblems
*e+words: graphical solution6 unbounded problem
AA,&-: Anal+tic sills
1) A linear programming problem that results in a solution that is EEEEEEEE usuall+ indicates that the
linear program has been incorrectl+ formulated.
Answer: infeasible
"iff: # $age Ref: 2
&ection eading: 7rregular T+pes of Linear $rogramming $roblems
*e+words: graphical solution6 infeasible solution
AA,&-: Anal+tic sills
) EEEEEEEE is the difference between the left= and right=hand sides of a greater than or e<ual to
constraint.
Answer: &urplus
"iff: 1 $age Ref: 2#
&ection eading: A (inimi0ation (odel !/ample
*e+words: surplus
AA,&-: Anal+tic sills
2) 7f the objective function is parallel to a constraint6 the linear program could have EEEEEEEE.
Answer: multiple optimal solutions
"iff: # $age Ref:
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical solutions6 multiple optimal solutions
AA,&-: Anal+tic sills
8
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
3) ,orner points on the boundar+ of the feasible solution area are called EEEEEEEE points.
Answer: e/treme
"iff: 1 $age Ref: 1
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: feasibilit+6 constraints
AA,&-: Anal+tic sills
8) EEEEEEEE are at the endpoints of the constraint line segment that the objective function parallels.
Answer: Alternate optimal solutions
"iff: % $age Ref: 2
&ection eading: 7rregular T+pes of Linear $rogramming $roblems
*e+words: alternative optimal solutions6 multiple optimal solutions
AA,&-: Anal+tic sills
9) The EEEEEEEE step in formulating a linear programming model is to define the decision variables.
Answer: first
"iff: 1 $age Ref: %%
&ection eading: A (a/imi0ation (odel !/ample
*e+words: linear programming6 formulation
AA,&-: Anal+tic sills
) The management scientist constructed a linear program to help the alchemist ma/imi0e his gold
production process. The computer model chugged awa+ for a few minutes and returned an answer of
infinite profit.6 which is what might be e/pected from aFn) EEEEEEEE problem.
Answer: unbounded
"iff: 1 $age Ref: 22
&ection eading: 7rregular T+pes of Linear $rogramming $roblems
*e+words: unbounded
AA,&-: Anal+tic sills
25) The EEEEEEEE propert+ of linear programming models indicates that the values of all the model
parameters are nown and are assumed to be constant.
Answer: certaint+
"iff: # $age Ref: 23
&ection eading: ,haracteristics of Linear $rogramming $roblems
*e+words: properties of linear programming models6 certaint+
AA,&-: Anal+tic sills
21) The EEEEEEEE propert+ of linear programming models indicates that the rate of change6 or slope6 of
the objective function or a constraint is constant.
Answer: proportionalit+ or linearit+
"iff: # $age Ref: 23
&ection eading: ,haracteristics of Linear $rogramming $roblems
*e+words: properties of linear programming models6 certaint+
AA,&-: Anal+tic sills
9
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
2#) The EEEEEEEE propert+ of linear programming models indicates that the decision variables cannot
be restricted to integer values and can tae on an+ fractional value.
Answer: divisibilit+
"iff: # $age Ref: 23
&ection eading: ,haracteristics of Linear $rogramming $roblems
*e+words: properties of linear programming models6 divisibilit+
AA,&-: Anal+tic sills
2%) The constraint # BC violates the EEEEEEEE propert+ of linear programming.
Answer: proportionalit+ or linear
"iff: 1 $age Ref: 23
&ection eading: ,haracteristics of Linear $rogramming $roblems
*e+words: properties of linear programming models
AA,&-: Anal+tic sills
x16 x# D 5
;hich constraints are binding at the optimal solutionH F x1 ?#256 x# ? 25)
Answer: constraints 1 and %
"iff: 1 $age Ref: 8=2%
&ection eading: A (inimi0ation (odel !/ample
*e+words: >raphical solution6 simultaneous solution
AA,&-: Anal+tic sills
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
23) &olve the following graphicall+:
(a/ z ? %x1 B x#
s.t. x1 B #x# G 13
#x1 B %x# G 19
x1 D#
x# G 15
x16 x# D 5
;hat are the optimal values of x16 x#6 and zH
Answer: x1 ? 6 x# ? 56 z ? #8
15
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
28) ,onsider the following linear program:
&olve this linear program graphicall+ and determine the optimal <uantities of A6 -6 and the value of I.
Answer: &olution shown below.
11
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
29) ,onsider the following linear program:
&olve this linear program graphicall+ and determine the optimal <uantities of A6 -6 and the value of I.
Answer: A ? #6 - ? 26 I ? %85
1#
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
2) A graphical representation of a linear program is shown below. The shaded area represents the
feasible region6 and the dashed line in the middle is the slope of the objective function.
35) A graphical representation of a linear program is shown below. The shaded area represents the
feasible region6 and the dashed line in the middle is the slope of the objective function.
1%
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
31) A graphical representation of a linear program is shown below. The shaded area represents the
feasible region6 and the dashed line in the middle is the slope of the objective function.
;hat would the be the new slope of the objective function if multiple optimal solutions occurred along
line segment A-H
Answer: =%K#
"iff: # $age Ref:
&ection eading: 7rregular T+pes of Linear $rogramming $roblems
*e+words: graphical solution6 multiple optimal solutions
AA,&-: Anal+tic sills
&ection eading:
*e+words: >raphical
graphical &olutions
solution6 of Linear $rogramming (odels
slac variables
AA,&-: Anal+tic sills
1
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
3%) ,onsider the following linear programming problem:
(a/ I ? %x B y
&ubject to: #5x B %#y G 1355
x B #y G #5
y G 5
x6 y D 5
&olve for the <uantities of / and + which will ma/imi0e I. ;hat is the value of the slac variable
associated with constraint #H
Answer: x ? 136 y ? 56 z ? 59 and slac Fs#) ? 3
"iff: # eading:
&ection $age Ref:>raphical
&olutions of Linear $rogramming (odels
*e+words: graphical solution6 slac variables
AA,&-: Anal+tic sills
32) The poultr+ farmer decided to mae his own chicen scratch b+ combining alfalfa and corn in rail
car <uantities. A rail car of corn costs 55 and a rail car of alfalfa costs #55. The farmer's chicens
have a minimum dail+ re<uirement of vitamin * F255 milligrams) and iron F55 milligrams)6 but it
doesn't matter whether those elements come from corn6 alfalfa6 or some other grain. A unit of corn
contains 125 milligrams of vitamin * and 82 milligrams of iron. A unit of alfalfa contains #25
milligrams of vitamin * and 25 milligrams of iron. ormulate the linear programming model for this
situation.
Answer: (in I ? 552, B #55A
12
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
33) ,onsider the following linear programming problem:
(a/ I ? %x1 B %x#
&ubject to: 15x1 B x# G 35
#2x1 B 25x# G #55
x16 x# D 5
ind the optimal profit and the values of x1 and x# at the optimal solution.
Answer: I ? #5.#26 x1 ? 2.26 x# ? 1.#2
"iff: # $age Ref: %=#
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical solution
AA,&-: Anal+tic sills
13
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
3) ,onsider the following linear programming problem:
(7J I ? %x1 B #x#
&ubject to: #x1 B %x# D 1#
2x1 B 9x# D %8
x16 x# D 5
At the optimal solution point6 the objective function value is 19. 7f the constraints are changed from
greater than to less than constraints and the objective function is changed from minimi0e to ma/imi0e6
what happens to the optimal solutionH "emonstrate whether it falls at the same optimal point.
Answer: Jo6 reversing the signs for the constraints and the objective function does not t+picall+ retain
the same optimal solution. 7n this case6 at x# ? .3#2 the new objective function value is .#2. 7n the
srcinal formulation the optimal value was at x1 ? 3.
"iff: % $age Ref: #
&ection eading: A (inimi0ation (odel !/ample
*e+words: optimal solutions
AA,&-: Anal+tic sills
81) >iven this set of constraints6 for what objective function is the point /?26 +?% in the feasible regionH
s.t %x B 3y G %5
15x B 15y G 35
15x B 12y G 5
Answer: Jo objective function can move that point into the feasible region.
"iff: # $age Ref: 5
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: feasibilit+6 constraints
AA,&-: Anal+tic sills
18
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
8#) ,onsider the following linear programming problem:
(7J I ? #x1 B %x#
&ubject to: x1 B #x# G #5
2x1 B x# G 5
x1 B3x# G 35
x1 6 x# D 5
;hat is the optimal solutionH
Answer: (ultiple optimal solutions e/ist between the e/treme point F5615) and F3.#62.%9) along the
line with a slope of =#K%.
"iff: # $age Ref: 8=2%
&ection eading: A (inimi0ation (odel !/ample
*e+words: graphical solution6 multiple optimal solutions
AA,&-: Anal+tic sills
8%) A compan+ producing a standard line and a delu/e line of dishwashers has the following time
re<uirements Fin minutes) in departments where either model can be processed.
Standard elu!e
&tamping % 3
(otorinstallation 15 15
;iring 15 12
The standard models contribute #5 each and the delu/e %5 each to profits. -ecause the compan+
produces other items that share resources used to mae the dishwashers6 the stamping machine is
available onl+ %5 minutes per hour6 on average. The motor installation production line has 35 minutes
available each hour. There are two lines for wiring6 so the time availabilit+ is 5 minutes per hour.
"iff: # 15x$age y G 5
B 12Ref: %%
&ection eading: A (a/imi0ation (odel !/ample
*e+words: formulation6 objective function6 constraints
AA,&-: Anal+tic sills
19
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
8) 7n a linear programming problem6 the binding constraints for the optimal solution are:
2x1 B %x# G %5
#x1 B 2x# G #5
As long as the slope of the objective function sta+s between EEEEEEEE and EEEEEEEE6 the current
optimal solution point will remain optimal.
Answer: =2K%6 =#K2
"iff: % $age Ref:
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: optimal solution6 solution interpretation6 slope
&ection eading:
*e+words: >raphical
optimal solution6&olutions of Linear $rogramming
solution interpretation6 slope (odels
AA,&-: Anal+tic sills
1
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
89) ;hich of the following could not be a linear programming problem constraintH
A) 1A B #- M %
-) 1A B #- ? %
,) 1A B #- G %
") 1A B #- D %
Answer: A
"iff: # $age Ref: %%
&ection eading: A (a/imi0ation (odel !/ample
*e+words: formulation6 constraints
AA,&-: Anal+tic sills
#5
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
9#) The production manager for the ,oor+ soft drin compan+ is considering the production of two
inds of soft drins: regular FR) and diet F"). Two of her limited resources are production time F9 hours
? 95 minutes per da+) and s+rup F1 of the ingredients)6 limited to 382 gallons per da+. To produce a
regular case re<uires # minutes and 2 gallons of s+rup6 while a diet case needs minutes and % gallons
of s+rup. $rofits for regular soft drin are %.55 per case and profits for diet soft drin are #.55 per
case. ;hat is the objective functionH
A) (A #R B "
-) (A %R B #"
,) (A %" B #R
") (A " B #R
Answer: -
"iff: # $age Ref: %#
&ection eading: A (a/imi0ation (odel !/ample
*e+words: formulation6 objective function
AA,&-: Anal+tic sills
9%) The production manager for the ,oor+ soft drin compan+ is considering the production of two
inds of soft drins: regular FR) and dietF"). Two of the limited resources are production time F9 hours ?
95 minutes per da+) and s+rup F1 of the ingredients)6 limited to 382 gallons per da+. To produce a
regular case re<uires # minutes and 2 gallons of s+rup6 while a diet case needs minutes and % gallons
of s+rup. $rofits for regular soft drin are %.55 per case and profits for diet soft drin are #.55 per
case. ;hat is the time constraintH
A) #" B R G 95
-) #R B %" G 95
,) %R B #" G 95
") #R B " G 95
Answer: "
"iff: # $age Ref: %#
&ection eading: A (a/imi0ation (odel !/ample
*e+words: formulation6 constraints
AA,&-: Anal+tic sills
#1
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
92) ,ull+ urniture bu+s two products for resale: big shelves F-) and medium shelves F(). !ach big
shelf costs 255 and re<uires 155 cubic feet of storage space6 and each medium shelf costs %55 and
re<uires 5 cubic feet of storage space. The compan+ has 826555 to invest in shelves this wee6 and the
warehouse has 196555 cubic feet available for storage. $rofit for each big shelf is %55 and for each
medium shelf is 125. ;hat is the objective functionH
A) (A I ? %55 - B 155 (
-) (A I ? %55 ( B 125 -
,) (A I ? %55 - B 125 (
") (A I ? %55 - B 255 (
Answer: ,
"iff: # $age Ref: %%
&ection eading: A (a/imi0ation (odel !/ample
*e+words: formulation6 objective function
AA,&-: Anal+tic sills
93) ,ull+ Turniture bu+s two products for resale: big shelves F-) and medium shelves F(). !ach big
shelf costs 255 and re<uires 155 cubic feet of storage space6 and each medium shelf costs %55 and
re<uires 5 cubic feet of storage space. The compan+ has 826555 to invest in shelves this wee6 and the
warehouse has 196555 cubic feet available for storage. $rofit for each big shelf is %55 and for each
medium shelf is 125. ;hat is the storage space constraintH
A) 5 - B 155 ( D 19555
-) 5 - B 155 ( G 19555
,) 155 - B 5 ( G 19555
") 255 - B %55 ( G 19555
Answer: ,
"iff: # $age Ref: %
&ection eading: A (a/imi0ation (odel !/ample
*e+words: formulation6 constraints
AA,&-: Anal+tic sills
98) The EEEEEEEE propert+ of linear programming models indicates that the decision variables cannot
be restricted to integer values and can tae on an+ fractional value.
A) linearit+
-) additive
,) divisibilit+
") proportionalit+
Answer: ,
"iff: # $age Ref: 23
&ection eading: ,haracteristics of Linear $rogramming $roblems
*e+words: properties of linear programming models
AA,&-: Anal+tic sills
##
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
99) The EEEEEEEE propert+ of linear programming models indicates that the rate of change or slope of
the objective function or a constraint is constant.
A) additive
-) divisibilit+
,) certaint+
") proportionalit+
Answer: "
"iff: # $age Ref: 23
&ection eading: ,haracteristics of Linear $rogramming $roblems
*e+words: properties of linear programming models
AA,&-: Anal+tic sills
9) The EEEEEEEE propert+ of linear programming models indicates that the values of all the model
parameters are nown and are assumed to be constant.
A) additive
-) divisibilit+
,) certaint+
") proportionalit+
Answer: ,
"iff: # $age Ref: 23
&ection eading: ,haracteristics of Linear $rogramming $roblems
*e+words: properties of linear programming models
AA,&-: Anal+tic sills
5) The region that satisfies all of the constraints in a graphical linear programming problem is called
the
A) region of optimalit+.
-) feasible solution space.
,) region of non=negativit+.
") optimal solution space.
Answer: -
"iff: 1 $age Ref: %9
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical solution6 feasibilit+
AA,&-: Anal+tic sills
#%
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
#) ;hich of the following statements is not trueH
A) An infeasible solution violates all constraints.
-) A feasible solution point does not have to lie on the boundar+ of the feasible solution.
,) A feasible solution satisfies all constraints.
") An optimal solution satisfies all constraints.
Answer: A
"iff: # $age Ref: %9
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical solution6 feasibilit+
AA,&-: Anal+tic sills
%) A hot dog manufacturer wishes to minimi0e the cost in dollars of producing a low=cost niched
product while meeting the dietar+ guidelines for protein and sodium. @nce the model has been run6 the
surplus variable in the sodium constraint has a value of 1%55 milligrams. The best interpretation of this
outcome is:
A) The value of the sodium in a hot dog is 1%55.
-) The amount of sodium in a single hot dog should be 1%55 milligrams.
,) The minimum cost hot dog has 1%55 milligrams more sodium than re<uired.
") A hot dog should have at least 1%55 milligrams of sodium.
Answer: ,
"iff: # $age Ref: 2#
&ection eading: A (inimi0ation (odel !/ample
*e+words: surplus
AA,&-: Anal+tic sills
2) The optimal solution to a linear programming model that has been solved using the graphical
approach
A) is t+picall+ located at the srcin.
-) must be below and on the left side of all constraint lines.
,) must be above and the the right of all constraint lines.
") is t+picall+ at some corner of the feasible region.
Answer: A
"iff: 1 $age Ref: %
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: solution
AA,&-: Anal+tic sills
#
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
3) ;ithout satisf+ing the non=negativit+ constraint6 a solution that satisfies all the other constraints of a
linear programming problem is called
A) feasible.
-) infeasible.
,) semi=feasible.
") optimal.
Answer: -
"iff: % $age Ref: %9
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical solution6 feasibilit+
AA,&-: Anal+tic sills
8) An intern sets up a linear program to optimi0e the use of paper products in the men's washroom. The
s+stem of e<uations he develops is:
(a/ #T B %& B &T
s.t %T B 3& G 5
15T B 15& G 33
15T B 12& G
is mentor studies the model6 frowns6 and admonishes the intern for violating which of the following
properties of linear programming modelsH
A) "ivisibilit+
-) $roportionalit+
,) ,ertaint+
") Additivit+
Answer: "
"iff: 1 $age Ref: 23
&ection eading: ,haracteristics of Linear $rogramming $roblems
*e+words: additivit+
AA,&-: Anal+tic sills
9) ;hich of the following is not a t+pical characteristic of a linear programming problemH
A) Restrictions e/ist.
-) A choice among alternatives is re<uired.
,) The problem can be solved graphicall+.
") The problem has an objective.
Answer:
"iff: 1 ,$age Ref: 23
&ection eading: ,haracteristics of Linear $rogramming $roblems
*e+words: graphical solution
AA,&-: Anal+tic sills
#2
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
) The production manager for the ,oor+ soft drin compan+ is considering the production of two
inds of soft drins: regular and diet. Two of her limited resources are production time F9 hours ? 95
minutes per da+) and s+rup F1 of the ingredients)6 limited to 382 gallons per da+. To produce a regular
case re<uires # minutes and 2 gallons of s+rup6 while a diet case needs minutes and % gallons of s+rup.
$rofits for regular soft drin are %.55 per case and profits for diet soft drin are #.55 per case. ;hich
of the following is not a feasible production combinationH
A) 5R and 82"
-) 1%2R and 5"
,) 82R and 5"
") 5R and 155"
Answer: ,
"iff: % $age Ref: %3
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical solution6 feasibilit+
AA,&-: Anal+tic sills
155) The production manager for the ,oor+ soft drin compan+ is considering the production of two
inds of soft drins: regular and diet. Two of her limited resources are production time F9 hours ? 95
minutes per da+) and s+rup F1 of the ingredients)6 limited to 382 gallons per da+. To produce a regular
case re<uires # minutes and 2 gallons of s+rup6 while a diet case needs minutes and % gallons of s+rup.
$rofits for regular soft drin are %.55 per case and profits for diet soft drin are #.55 per case. ;hat
are the optimal dail+ production <uantities of each product and the optimal dail+ profitH
A) R ? 826 " ? 56 I ? 52
-) R ? 1%26 " ? 56 I ? 52
,) R ? 56 " ? 826 I ? #5
") R ? 56 "? 1556 I ? %#5
Answer: ,
"iff: % $age Ref: 1
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical solution
AA,&-: Anal+tic sills
,)
") &ensitivit+ anal+sis
A slac variable
Answer: ,
"iff: # $age Ref:
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: sensitivit+ anal+sis
AA,&-: Anal+tic sills
#3
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
15#) ,ull+ urniture bu+s two products for resale: big shelves F-)and medium shelves F(). !ach big
shelf costs 255 and re<uires 155 cubic feet of storage space6 and each medium shelf costs %55 and
re<uires 5 cubic feet of storage space. The compan+ has 826555 to invest in shelves this wee6 and the
warehouse has 196555 cubic feet available for storage. $rofit for each big shelf is %55 and for each
medium shelf is 125. ;hich of the following is not a feasible purchase combinationH
A) 155 big shelves and 9# medium shelves
-) 125 big shelves and 5 medium shelves
,) 155 big shelves and 155 medium shelves
") 155 big shelves and 5 medium shelves
Answer: ,
"iff: % $age Ref: %
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: formulation6 feasibilit+
AA,&-: Anal+tic sills
15%) ,ull+ urniture bu+s two products for resale: big shelves F-) and medium shelves F(). !ach big
shelf costs 255 and re<uires 155 cubic feet of storage space6 and each medium shelf costs %55 and
re<uires 5 cubic feet of storage space. The compan+ has 826555 to invest in shelves this wee6 and the
warehouse has 196555 cubic feet available for storage. $rofit for each big shelf is %55 and for each
medium shelf is 125. ;hat is the ma/imum profitH
A) %26555
-) 26555
,) 226555
") 326555
Answer: -
"iff: % $age Ref: %
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical solution
AA,&-: Anal+tic sills
15) ,ull+ urniture bu+s two products for resale: big shelves F-) and medium shelves F(). !ach big
shelf costs 255 and re<uires 155 cubic feet of storage space6 and each medium shelf costs %55 and
re<uires 5 cubic feet of storage space. The compan+ has 826555 to invest in shelves this wee6 and the
warehouse has 196555 cubic feet available for storage. $rofit for each big shelf is %55 and for each
medium shelf is 125. 7n order to ma/imi0e profit6 how man+ big shelves F-) and how man+ medium
shelves F() should be purchasedH
A) - ? 56 ( ? 82
-) - ? 1256 ( ? 5
,) - ? 56 ( ? #55
") - ? 1556 ( ? 155
Answer: -
"iff: % $age Ref: %
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical solution
AA,&-: Anal+tic sills
#8
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
152) The theoretical limit on the number of constraints that can be handled b+ a linear programming
problem is:
A) #
-) %
,)
") unlimited
Answer: "
"iff: 1 $age Ref: %1
&ection eading: (odel ormulation
*e+words: constraints
AA,&-: Anal+tic sills
#9
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
The following is a graph of a linear programming problem. The feasible solution space is shaded6 and
the optimal solution is at the point labeled Z*.
#
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
15) ;hich of the following points is not feasibleH
A) A
-) -
,)
") >
Answer: "
"iff: 1 $age Ref: %9
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical solution6 feasible point
AA,&-: Anal+tic sills
%5
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
11%) (ultiple optimal solutions can occur when the objective function is EEEEEEEE a constraint line.
A) une<ual to
-) e<ual to
,) perpendicular to
") parallel to
Answer: "
"iff: # $age Ref: 2
&ection eading: 7rregular T+pes of Linear $rogramming $roblems
*e+words: irregular t+pes of linear programming problems
AA,&-: Anal+tic sills
112) The production manager for the ,oor+ soft drin compan+ is considering the production of two
inds of soft drins: regular and diet. Two of her limited resources are production time F9 hours ? 95
minutes per da+) and s+rup F1 of the ingredients)6 limited to 382 gallons per da+. To produce a regular
case re<uires # minutes and 2 gallons of s+rup6 while a diet case needs minutes and % gallons of s+rup.
$rofits for regular soft drin are %.55 per case and profits for diet soft drin are #.55 per case. or the
production combination of 1%2 cases of regular and 5 cases of diet soft drin6 which resources will not
be completel+ usedH
A) onl+ time
-) onl+ s+rup
,) time and s+rup
") neither time nor s+rup
Answer: A
"iff: # $age Ref: %3
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: slac variables
AA,&-: Anal+tic sills
%1
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
113) ,ull+ urniture bu+s two products for resale: big shelves F-) and medium shelves F(). !ach big
shelf costs 255 and re<uires 155 cubic feet of storage space6 and each medium shelf costs %55 and
re<uires 5 cubic feet of storage space. The compan+ has 826555 to invest in shelves this wee6 and the
warehouse has 196555 cubic feet available for storage. $rofit for each big shelf is %55 and for each
medium shelf is 125. 7f the furniture compan+ purchases no big shelves and #55 medium shelves6
which of the two resources will be completel+ used Fat capacit+)H
A) investment mone+ onl+
-) storage space onl+
,) investment mone+ and storage space
") neither investment mone+ nor storage space
Answer: -
"iff: # $age Ref: %
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: slac variables
AA,&-: Anal+tic sills
,)
") solve simultaneous
determine e<uationsare
which constraints at each corner point to find the solution values at each point.
binding.
Answer: A
"iff: 1 $age Ref: %3
&ection eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphic solution6 steps for solving a graphical linear prog model
AA,&-: Anal+tic sills
%#
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all
11) The optimal solution of a minimi0ation problem is at the e/treme point EEEEEEEE the srcin.
A) farthest from
-) closest to
,) e/actl+ at
") parallel to
Answer: -
"iff: # $age Ref: 25
&ection eading: A (inimi0ation (odel !/ample
*e+words: minimi0ation problem
AA,&-: Anal+tic sills
1#5) (ultiple optimal solutions provide EEEEEEEE fle/ibilit+ to the decision maer.
A) greater
-) less
,) greater or e<ual
") less or e<ual
Answer: A
"iff: # $age Ref: 2
&ection eading: 7rregular T+pes of Linear $rogramming $roblems
*e+words: irregular t+pes of linear programming problems
AA,&-: Anal+tic sills
1#1) ;hich of the following special cases does not re<uire reformulation of the problem in order to
obtain a solutionH
A) unboundedness
-) infeasibilit+
,) alternate optimalit+
") !ach one of these cases re<uires reformulation.
Answer: ,
"iff: % $age Ref: 2
&ection eading: 7rregular T+pes of Linear $rogramming $roblems
*e+words: irregular t+pes of linear programming problems
AA,&-: Anal+tic sills
1##) 7f the feasible region for a linear programming problem is unbounded6 then the solution to the
corresponding linear programming problem is EEEEEEEE unbounded.
A) alwa+s
-) sometimes
,) never
") There is not enough information to complete this statement.
Answer: -
"iff: % $age Ref: 22
&ection eading: 7rregular T+pes of Linear $rogramming $roblems
*e+words: irregular t+pes of linear programming problems6 unboundedness
AA,&-: Anal+tic sills
%%
,op+right 4 #51% $earson igher !ducation6 7nc. $ublishing as $rentice all