Taylor Ims11 Tif Ch02

Introduction to Management Science, 11e (Taylor)
Chapter 2 Linear Programming: Model Formulation and Graphical Solution

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 s.ills
#) The objective function alwa+s consists of either ma/imi0ing or minimi0ing some value.
Answer: TR!
*e+words: objective function
%) The objective function is a linear relationship reflecting the objective of an operation.
Answer: TR!
"iff: 1 $age Ref: %1
1) A constraint is a linear relationship representing a restriction on decision ma.ing.
Answer: TR!
2) A linear programming model consists of onl+ decision variables and constraints.
Answer: )AL&!
"iff: 1 $age Ref: 23
&ection 'eading: ,haracteristics of Linear $rogramming $roblems
3) A parameter is a numerical value in the objective function and constraints.
Answer: TR!
*e+words: parameter
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&!
9) $roportionalit+ means the slope of a constraint is proportional to the slope of the objective function.
Answer: )AL&!
"iff: # $age Ref: 23
*e+words: properties of linear programming models6 proportionalit+
:) The terms in the objective function or constraints are additive.
Answer: TR!
*e+words: properties of linear programming models6 additive
15) The terms in the objective function or constraints are multiplicative.
Answer: )AL&!
*e+words: properties of linear programming models6 additive
11) The values of decision variables are continuous or divisible.
Answer: TR!
*e+words: properties of linear programming models6 divisible
1#) All model parameters are assumed to be .nown with certaint+.
Answer: TR!
*e+words: properties of linear programming models
1%) 7n linear programming models 6 objective functions can onl+ be ma/imi0ed.
Answer: )AL&!
*e+words: properties of linear programming models6 objective function
#
11) All linear programming models e/hibit a set of constraints.
Answer: TR!
*e+words: properties of linear programming models6 constraints
12) ;hen using the graphical method6 onl+ one of the four <uadrants of an xy=a/is needs to be drawn.
Answer: TR!
&ection 'eading: >raphical &olutions of Linear $rogramming (odels
*e+words: graphical linear programming
13) Linear programming models e/hibit linearit+ among all constraint relationships and the objective
function.
Answer: TR!
*e+words: properties of linear prog models6 linearit+6 proportionalit+
18) The e<uation 9xy ? %# satisfies the proportionalit+ propert+ of linear programming.
Answer: )AL&!
*e+words: graphical solution6 proportionalit+
19) T+picall+6 finding a corner point for the feasible region involves solving a set of three simultaneous
e<uations.
Answer: )AL&!
*e+words: graphical solution6 e/treme points6 feasible region
1:) @bjective functions in linear programs alwa+s minimi0e costs.
Answer: )AL&!
*e+words: properties of linear programming models6 objective function
#5) The feasible solution area contains infinite solutions to the linear program.
Answer: TR!
*e+words: properties of linear programming models6 feasible solution area
%
#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
##) The following e<uation represents a resource constraint for a ma/imi0ation problem: A B C D #5.
Answer: )AL&!
&ection 'eading: A (a/imi0ation (odel !/ample
*e+words: properties of linear programming models6 constraints
#%) The optimal solution for a graphical linear programming problem is the corner point that is the
farthest from the origin.
Answer: )AL&!
*e+words: feasibilit+6 constraints
#1) A minimi0ation model of a linear program contains onl+ surplus variables.
Answer: )AL&!
"iff: 1 $age Ref: 2#
&ection 'eading: A (inimi0ation (odel !/ample
*e+words: properties of linear programming models6 surplus variables
#2) 7n the graphical approach6 simultaneous e<uations ma+ be used to solve for the optimal solution
point.
Answer: TR!
"iff: # $age Ref: 1#
*e+words: graphical solution
#3) &lac. variables are onl+ associated with ma/imi0ation problems.
Answer: )AL&!
*e+words: graphical solution6 slac. variables
1
#8) &urplus variables are onl+ associated with minimi0ation problems.
Answer: )AL&!
*e+words: graphical solution6 surplus variable
#9) 7f the objective function is parallel to a constraint6 the constraint is infeasible.
Answer: )AL&!
#:) (ultiple optimal solutions occur when constraints are parallel to each other.
Answer: )AL&!
%5) >raphical solutions to linear programming problems have an infinite number of possible objective
function lines.
Answer: TR!
"iff: # $age Ref: %:
*e+words: graphical solution6 objective function line
%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
%#) EEEEEEEE are mathematical s+mbols representing levels of activit+.
Answer: "ecision variables
*e+words: decision variables6 model formulation
%%) The EEEEEEEE is a linear relationship reflecting the objective of an operation.
Answer: objective function
*e+words: objective function6 model formulation
2
%1) A EEEEEEEE is a linear relationship representing a restriction on decision ma.ing.
Answer: constraint
*e+words: constraint6 model formulation
%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+
*e+words: nonnegativit+
%3) 7f at least one constraint in a linear programming model is violated6 the solution is said to be
EEEEEEEE.
Answer: infeasible
*e+words: constraint6 infeasible solution
%8) A graphical solution is limited to solving linear programming problems with EEEEEEEE decision
variables
Answer: two
%9) The EEEEEEEE solution area is an area bounded b+ the constraint e<uations.
Answer: feasible
%:) (ultiple optimal solutions can occur when the objective function line is EEEEEEEE to a constraint
line.
Answer: parallel
*e+words: graphical solution6 multiple optimal solutions
3
15) ;hen a ma/imi0ation problem is EEEEEEEE6 the objective function can increase indefinitel+ without
reaching a ma/imum value.
Answer: unbounded
*e+words: graphical solution6 unbounded problem
11) A linear programming problem that results in a solution that is EEEEEEEE usuall+ indicates that the
linear program has been incorrectl+ formulated.
Answer: infeasible
*e+words: graphical solution6 infeasible solution
1#) The best feasible solution is EEEEEEEE.
Answer: optimal
*e+words: optimal solutions
1%) 7n a constraint6 the EEEEEEEE variable represents unused resources.
Answer: slac.
*e+words: graphical solution6 surplus variable
11) EEEEEEEE is the difference between the left= and right=hand sides of a greater than or e<ual to
constraint.
Answer: &urplus
*e+words: surplus
12) 7f the objective function is parallel to a constraint6 the linear program could have EEEEEEEE.
Answer: multiple optimal solutions
*e+words: graphical solutions6 multiple optimal solutions
8
13) ,orner points on the boundar+ of the feasible solution area are called EEEEEEEE points.
Answer: e/treme
18) EEEEEEEE are at the endpoints of the constraint line segment that the objective function parallels.
Answer: Alternate optimal solutions
"iff: % $age Ref: 21
*e+words: alternative optimal solutions6 multiple optimal solutions
19) The EEEEEEEE step in formulating a linear programming model is to define the decision variables.
Answer: first
"iff: 1 $age Ref: %%
*e+words: linear programming6 formulation
1:) 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
*e+words: unbounded
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+
*e+words: properties of linear programming models6 certaint+
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+
*e+words: properties of linear programming models6 certaint+
9
2#) The EEEEEEEE propert+ of linear programming models indicates that the decision variables cannot
be restricted to integer values and can ta.e on an+ fractional value.
Answer: divisibilit+
*e+words: properties of linear programming models6 divisibilit+
2%) The constraint #A BAC violates the EEEEEEEE propert+ of linear programming.
Answer: proportionalit+ or linear
21) ,onsider the following minimi0ation problem:
(in 0 ? x
1
B #x
#
s.t. x
1
B x
#
D %55
#x
1
B x
#
D 155
#x
1
B 2x
#
G 825
x
1
6 x
#
D 5
;hat is the optimal solutionH
Answer: /
1
? #256 /
#
? 256 0 ? %25
"iff: % $age Ref: 18=2%
*e+words: >raphical solution6 simultaneous solution
22) ,onsider the following minimi0ation problem:
(in 0 ? x
1
B #x
#
s.t. x
1
B x
#
D %55
#x
1
B x
#
D 155
#x
1
B 2x
#
G 825
x
1
6 x
#
D 5
;hich constraints are binding at the optimal solutionH Fx
1
?#256 x
#
? 25)
Answer: constraints 1 and %
"iff: 1 $age Ref: 18=2%
*e+words: >raphical solution6 simultaneous solution
:
23) &olve the following graphicall+:
(a/ z ? %x
1
B 1x
#
s.t. x
1
B #x
#
G 13
#x
1
B %x
#
G 19
x
1
D #
x
#
G 15
x
1
6 x
#
D 5
;hat are the optimal values of x
1
6 x
#
6 and zH
Answer: x
1
? :6 x
#
? 56 z ? #8
"iff: % $age Ref: %2=13
*e+words: graphical solution6 simultaneous solution
15
28) ,onsider the following linear program:
(AA I ? 35A B 25-
s.t. 15A B #5- G #55
9A B 2- G 95
A D #
- D 2
&olve this linear program graphicall+ and determine the optimal <uantities of A6 -6 and the value of I.
Answer: &olution shown below.
"iff: # $age Ref: %2=13
11
(7J I ? 35A B 25-
s.t. 15A B #5- G #55
9A B 2- G 95
A D #
- D 2
&olve this linear program graphicall+ and determine the optimal <uantities of A6 -6 and the value of I.
Answer: A ? #6 - ? 26 I ? %85
"iff: # $age Ref: %2=13
1#
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.
7f this is a ma/imi0ation6 which e/treme point is the optimal solutionH
Answer: !
35) A graphical representation of a linear program is shown below. The shaded area represents the
7f this is a minimi0ation6 which e/treme point is the optimal solutionH
Answer: A
1%
31) A graphical representation of a linear program is shown below. The shaded area represents the
;hat would the be the new slope of the objective function if multiple optimal solutions occurred along
line segment A-H
Answer: =%K#
3#) ,onsider the following linear programming problem:
(a/ I ? L12x B L#5y
&ubject to: 9x B 2y G 15
5.1x B y D 1
x6 y D 5
"etermine the values for / and + that will ma/imi0e revenue. >iven this optimal revenue6 what is the
amount of slac. associated with the first constraintH
Answer: x ? 56 y ? 96 revenue ? L1356 s
1
? 5
11
3%) ,onsider the following linear programming problem:
(a/ I ? L%x B L:y
&ubject to: #5x B %#y G 1355
1x B #y G #15
y G 15
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 ? 156 z ? L159 and slac. Fs
#
) ? :3
31) ,onsider the following linear programming problem:
(a/ I ? 2x
1
B %x
#
&ubject to: 3x
1
B #x
#
G 19
12x
1
B #5x
#
G 35
x
1
6 x
#
D 5
)ind the optimal profit and the values of /
1
and /
#
at the optimal solution.
Answer: I ? 13.%%%6 x
1
? #.33386 x
#
? 1.5
32) The poultr+ farmer decided to ma.e his own chic.en scratch b+ combining alfalfa and corn in rail
car <uantities. A rail car of corn costs L155 and a rail car of alfalfa costs L#55. The farmer's chic.ens
have a minimum dail+ re<uirement of vitamin * F255 milligrams) and iron F155 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 ? L1552, B L#55A

&ubject to: 125, B #25A
D
255
82, B 25A
D
155
,6 A D 5
"iff: % $age Ref: %1
*e+words: constraint6 model formulation
12
(a/ I ? %x
1
B %x
#
&ubject to: 15x
1
B 1x
#
G 35
#2x
1
B 25x
#
G #55
x
1
6 x
#
D 5
)ind the optimal profit and the values of x
1
and x
#
at the optimal solution.
Answer: I ? #5.#26 x
1
? 2.26 x
#
? 1.#2
"iff: # $age Ref: %1=1#
(7J I ? 15x
1
B #5x
#
&ubject to: x
1
B x
# D
1#
#x
1
B 2x
# D
15
x
# G
1%
x
1
6 x
# D
5
;hat is minimum cost and the value of /
1
and /
#
at the optimal solutionH
Answer: I ? 18%.%%%6 x
1
? 3.3386 x
#
? 2.%%%
"iff: # $age Ref: 18=2%
(7J I ? %x
1
B #x
#
&ubject to: #x
1
B %x
# D
1#
2x
1
B 9x
# D
%8
x
1
6 x
# D
5
;hat is minimum cost and the value of x
1
and x
#
at the optimal solutionH
Answer: :.#2 at x
1
? 5 and x
#
? 1.3#2
"iff: % $age Ref: 1#
*e+words: minimi0ation problem
13
3:) ,onsider the following linear programming problem:
(7J I ? %x
1
B #x
#
&ubject to: #x
1
B %x
# D
1#
2x
1
B 9x
# D
%8
x
1
6 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
#
? 1.3#2 the new objective function value is :.#2. 7n the
original formulation the optimal value was at x
1
? 3.
"iff: % $age Ref: 1#
*e+words: optimal solutions
(7J I ? 15x
1
B #5x
#
&ubject to: x
1
B x
# D
1#
#x
1
B 2x
# D
15
x
# G
1%
x
1
6 x
# D
5
At the optimal solution6 what is the value of surplus associated with constraint 1 and constraint %6
respectivel+H
Answer: constraint 1: F5 surplus)6 constraint #: F8.338 surplus)
"iff: # $age Ref: 18=2%
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.
18
8#) ,onsider the following linear programming problem:
(7J I ? #x
1
B %x
#
&ubject to: x
1
B #x
#
G #5
2x
1
B x
#
G 15
1x
1
B3x
#
G 35
x
1
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: 18=2%
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
(otor installation 15 15
;iring 15 12
The standard models contribute L#5 each and the delu/e L%5 each to profits. -ecause the compan+
produces other items that share resources used to ma.e 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.
Let x ? number of standard dishwashers produced per hour
y ? number of delu/e dishwashers produced per hour
;rite the formulation for this linear program.
Answer: (a/ #5x B %5y
s.t %x B 3y G %5
15x B 15y G 35
15x B 12y G :5
"iff: # $age Ref: %%
*e+words: formulation6 objective function6 constraints
19
81) 7n a linear programming problem6 the binding constraints for the optimal solution are:
2x
1
B %x
#
G %5
#x
1
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
*e+words: optimal solution6 solution interpretation6 slope
82) 7n a linear programming problem6 the binding constraints for the optimal solution are:
2x
1
B %x
#
G %5
#x
1
B 2x
#
G #5
;hich of these objective functions will lead to the same optimal solutionH
A) #x
1
B 1x
#
-) 8x
1
B 9x
#
,) 95x
1
B 35x
#
") #2x
1
B 12x
#
Answer: "
"iff: % $age Ref: %:
*e+words: optimal solution6 solution interpretation6 slope
83) "ecision variables
A) measure the objective function.
-) measure how much or how man+ items to produce6 purchase6 hire6 etc.
,) alwa+s e/ist for each constraint.
") measure the values of each constraint.
Answer: -
*e+words: decision variables
88) 7n a linear programming problem6 a valid objective function can be represented as:
A) (a/ I ? 2/+
-) (a/ I 2x
#
B #y
#

,) (a/ %x B %y B 1K% z
") (in Fx
1
B x
#
) K x
%

Answer: ,
1:
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
*e+words: formulation6 constraints
8:) A linear programming model consists of
A) decision variables.
-) an objective function.
,) constraints.
") all of the above
Answer: "
*e+words: components of linear programming
95) The minimi0ation of cost or ma/imi0ation of profit is the
A) constraint of operations management.
-) goal of management science.
,) objective of linear programming.
") assumption of financialit+.
Answer: ,
*e+words: objective6 cost minimi0ation6 profit ma/imi0ation
91) ;hich of the following could be a linear programming objective functionH
A) I ? 1A B #-, B %"
-) I ? 1A B #- B %, B 1"
,) I ? 1A B #- K , B %"
") I ? 1A B #-
#
B %"
Answer: -
#5
9#) The production manager for the ,oor+ soft drin. compan+ is considering the production of two
.inds of soft drin.s: regular FR) and diet F"). Two of her limited resources are production time F9 hours
? 195 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 1 minutes and % gallons
of s+rup. $rofits for regular soft drin. are L%.55 per case and profits for diet soft drin. are L#.55 per
case. ;hat is the objective functionH
A) (AA L#R B L1"
-) (AA L%R B L#"
,) (AA L%" B L#R
") (AA L1" B L#R
Answer: -
*e+words: formulation6 objective function
9%) The production manager for the ,oor+ soft drin. compan+ is considering the production of two
.inds of soft drin.s: regular FR) and dietF"). Two of the limited resources are production time F9 hours ?
195 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 1 minutes and % gallons
of s+rup. $rofits for regular soft drin. are L%.55 per case and profits for diet soft drin. are L#.55 per
case. ;hat is the time constraintH
A) #" B 1R G 195
-) #R B %" G 195
,) %R B #" G 195
") #R B 1" G 195
Answer: "
91) Jon=negativit+ constraints
A) re<uire the use of greater=than=or=e<ual=to constraints.
-) restrict the decision variables to positive values.
,) restrict the decision variables to negative values.
") do not restrict the sign of the decision variable.
Answer: -
*e+words: constraints
#1
92) ,ull+ )urniture bu+s two products for resale: big shelves F-) and medium shelves F(). !ach big
shelf costs L255 and re<uires 155 cubic feet of storage space6 and each medium shelf costs L%55 and
re<uires :5 cubic feet of storage space. The compan+ has L826555 to invest in shelves this wee.6 and the
warehouse has 196555 cubic feet available for storage. $rofit for each big shelf is L%55 and for each
medium shelf is L125. ;hat is the objective functionH
A) (AA I ? L%55 - B L155 (
-) (AA I ? L%55 ( B L125 -
,) (AA I ? L%55 - B L125 (
") (AA I ? L%55 - B L255 (
Answer: ,
*e+words: formulation6 objective function
93) ,ull+ Turniture bu+s two products for resale: big shelves F-) and medium shelves F(). !ach big
medium shelf is L125. ;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: ,
98) The EEEEEEEE propert+ of linear programming models indicates that the decision variables cannot
be restricted to integer values and can ta.e on an+ fractional value.
A) linearit+
-) additive
,) divisibilit+
") proportionalit+
Answer: ,
##
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: "
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: ,
: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: -
*e+words: graphical solution6 feasibilit+
:1) 7n the formulation of a D constraint6
A) a surplus variable is subtracted.
-) a surplus variable is added.
,) a slac. variable is subtracted.
") a slac. variable is added.
Answer: A
*e+words: surplus
#%
:#) ;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
:%) 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: ,
*e+words: surplus
:1) ;hich of these statements is bestH
A) An unbounded problem is also infeasible.
-) An infeasible problem is also unbounded.
,) An unbounded problem has feasible solutions.
") An infeasible problem has unbounded solutions.
Answer: ,
*e+words: infeasible problem6 infeasible solution
:2) The optimal solution to a linear programming model that has been solved using the graphical
approach
A) is t+picall+ located at the origin.
-) 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: %:
*e+words: solution
#1
: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: -
: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 1&T
s.t %T B 3& G 15
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: "
*e+words: additivit+
: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: ,
#2
::) The production manager for the ,oor+ soft drin. compan+ is considering the production of two
.inds of soft drin.s: regular and diet. Two of her limited resources are production time F9 hours ? 195
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 1 minutes and % gallons of s+rup.
$rofits for regular soft drin. are L%.55 per case and profits for diet soft drin. are L#.55 per case. ;hich
of the following is not a feasible production combinationH
A) :5R and 82"
-) 1%2R and 5"
,) 82R and :5"
") 15R and 155"
Answer: ,
155) The production manager for the ,oor+ soft drin. compan+ is considering the production of two
$rofits for regular soft drin. are L%.55 per case and profits for diet soft drin. are L#.55 per case. ;hat
are the optimal dail+ production <uantities of each product and the optimal dail+ profitH
A) R ? 826 " ? :56 I ? L152
-) R ? 1%26 " ? 56 I ? L152
,) R ? :56 " ? 826 I ? L1#5
") R ? 156 "? 1556 I ? L%#5
Answer: ,
151) EEEEEEEE is used to anal+0e changes in model parameters.
A) @ptimal solution
-) )easible solution
,) &ensitivit+ anal+sis
") A slac. variable
Answer: ,
*e+words: sensitivit+ anal+sis
#3
15#) ,ull+ )urniture bu+s two products for resale: big shelves F-)and medium shelves F(). !ach big
medium shelf is L125. ;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: ,
*e+words: formulation6 feasibilit+
15%) ,ull+ )urniture bu+s two products for resale: big shelves F-) and medium shelves F(). !ach big
medium shelf is L125. ;hat is the ma/imum profitH
A) L%26555
-) L126555
,) L226555
") L326555
Answer: -
medium shelf is L125. 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: -
#8
152) The theoretical limit on the number of constraints that can be handled b+ a linear programming
problem is:
A) #
-) %
,) 1
") unlimited
Answer: "
*e+words: constraints
153) ,onsider the following ma/imi0ation problem.
(AA 0 ? x B #y
s.t.
#x B %y G 3
2x B 3y G %5
y D 1
The optimal solution
A) occurs where x ? 1.38 and y ? 1.11.
-) occurs where x ? 5 and y ? #.
,) occurs where x ? 3 and y ? 5.
") results in an objective function value of 1#.
Answer: -
#9
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*.
158) This linear programming problem is aFn)
A) ma/imi0ation problem.
-) minimi0ation problem.
,) irregular problem.
") cannot tell from the information given
Answer: -
159) The e<uation for constraint "' is:
A) 1A B 9C D %#
-) 9A B 1C D %#
,) A B #C D 9
") #A B C D 9
Answer: ,
"iff: % $age Ref: 1:
*e+words: graphical solution6 constraints
#:
15:) ;hich of the following points is not feasibleH
A) A
-) -
,) '
") >
Answer: "
*e+words: graphical solution6 feasible point
115) ;hich line is represented b+ the e<uation #A B C D 9H
A) -)
-) ,>
,) "'
") AN
Answer: A
111) ;hich of the following constraints has a surplus greater than 5H
A) -)
-) ,>
,) "'
") AN
Answer: ,
11#) The constraint AN
A) is a binding constraint.
-) has no surplus.
,) does not contain feasible points.
") contains the optimal solution.
Answer: -
%5
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: "
*e+words: irregular t+pes of linear programming problems
111) A slac. variable
A) is the amount b+ which the left side of a D constraint is larger than the right side.
-) is the amount b+ which the left side of a G constraint is smaller than the right side.
,) is the difference between the left and right side of a constraint.
") e/ists for each variable in a linear programming problem.
Answer: -
&ection 'eading: &lac. Oariables
*e+words: slac. variables
112) The production manager for the ,oor+ soft drin. compan+ is considering the production of two
$rofits for regular soft drin. are L%.55 per case and profits for diet soft drin. are L#.55 per case. )or the
production combination of 1%2 cases of regular and 5 cases of diet soft drin.6 which resources will not
be completel+ usedH
A) onl+ time
-) onl+ s+rup
,) time and s+rup
") neither time nor s+rup
Answer: A
%1
medium shelf is L125. 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: -
(AA 0 ? 2x B %y
s.t. x = y G 3
x G 1
The optimal solution
A) is infeasible.
-) occurs where x ? 1 and y ? 5.
,) occurs where x ? 5 and y ? 1.
") results in an objective function value of 2.
Answer: "
119) The first step in solving a graphical linear programming model is to
A) plot the model constraints as e<uations on the graph and indicate the feasible solution area.
-) plot the objective function and move this line out from the origin to locate the optimal solution point.
,) solve simultaneous e<uations at each corner point to find the solution values at each point.
") determine which constraints are binding.
Answer: A
*e+words: graphic solution6 steps for solving a graphical linear prog model
%#
11:) The optimal solution of a minimi0ation problem is at the e/treme point EEEEEEEE the origin.
A) farthest from
-) closest to
,) e/actl+ at
") parallel to
Answer: -
*e+words: minimi0ation problem
1#5) (ultiple optimal solutions provide EEEEEEEE fle/ibilit+ to the decision ma.er.
A) greater
-) less
,) greater or e<ual
") less or e<ual
Answer: A
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: ,
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: -
*e+words: irregular t+pes of linear programming problems6 unboundedness
%%

Taylor Ims11 Tif Ch02

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Taylor Ims11 Tif Ch02

Hochgeladen von

Copyright:

Verfügbare Formate

Introduction to Management Science, 11e (Taylor)

Chapter 2 Linear Programming: Model Formulation and Graphical Solution

Das könnte Ihnen auch gefallen