0 10 20 30 40 50 60 70

x
x
1
optimal
point:
Z
C
B
A
10
20
30
40
50
60
2
x
1
= 15.29
x
2
= 38.24
Z = 4,205.88
80 90 100 110
70
80
90
100
110
1.
35. Model formulation; standard form
36. Graphical solution; sensitivity analysis (335)
37. Computer solution; sensitivity analysis (335)
38. Model formulation; computer solution
39. Sensitivity analysis (338)
40. Model formulation; computer solution
41. Sensitivity analysis (340)
42. Model formulation
43. Computer solution; sensitivity analysis (342)
44. Model formulation
45. Computer solution; sensitivity analysis (344)
46. Model formulation; standard form
47. Computer solution; sensitivity analysis (346)
48. Model formulation; standard form
49. Computer solution; sensitivity analysis (348)
50. Standard form; computer solution
PROBLEM SOLUTIONS
PROBLEM SUMMARY
1. QM for Windows
2. QM for Windows and Excel
3. Excel
4. Graphical solution; sensitivity analysis
5. Model formulation; standard form
6. Graphical solution; sensitivity analysis (35)
7. Sensitivity analysis (35)
8. Model formulation; standard form
9. Graphical solution; sensitivity analysis (38)
10. Sensitivity analysis (38)
11. Model formulation; standard form
12. Graphical solution; sensitivity analysis (311)
13. Computer solution; sensitivity analysis (311)
14. Model formulation; standard form
15. Graphical solution; sensitivity analysis (314)
16. Computer solution; sensitivity analysis (314)
17. Model formulation; standard form
18. Graphical solution; sensitivity analysis (317)
19. Computer solution; sensitivity analysis (317)
20. Model formulation; standard form
21. Graphical solution; sensitivity analysis (320)
22. Computer solution; sensitivity analysis (320)
23. Model formulation; standard form
24. Graphical solution; sensitivity analysis (323)
25. Computer solution; sensitivity analysis (323)
26. Model formulation; standard form
27. Graphical solution; sensitivity analysis (326)
28. Computer solution; sensitivity analysis (326)
29. Model formulation; standard form
30. Graphical solution; sensitivity analysis (329)
31. Computer solution; sensitivity analysis (329)
32. Standard form
33. Model formulation; computer solution
34. Computer solution; sensitivity analysis
17
Chapter Three: Linear Programming: Computer Solution and Sensitivity Analysis
21
8. (a)x
1
= no. of units of A
x
2
= no. of units of B
maximize Z = 9x
1
+ 7x
2
subject to
12x
1
+ 4x
2
60
4x
1
+ 8x
2
40
x
1
,x
2
0
(b) maximize Z = 9x
1
+ 7x
2
+ 0s
1
+ 0s
2
subject to
12x
1
+ 4x
2
+ s
1
= 60
4x
1
+ 8x
2
+ s
2
= 40
x
1
, x
2
, s
1
, s
2
0
9.
(a)A: 12(0) + 4(5) + s
1
= 60
s
1
= 40
4(0) + 8(5) + s
2
= 40
s
2
= 0
B: 12(4) + 4(3) = 60
s
1
= 0
4(4) + 8(3) + s
2
= 40
s
2
= 0
C: 12(5) + 4(0) + s
1
= 60
s
1
= 0
4(5) + 8(0) + s
2
= 40
s
2
= 20
(b) The constraint line 12x
1
+ 4x
2
= 60 would
move inward resulting in a new location for
point B at x
1
= 2, x
2
= 4, which would still be
optimal.
(c)In order for the optimal solution point to
change from B to A the slope of the objective
function must be at least as flat as the slope of
the constraint line, 4x
1
+ 8x
2
= 40, which is
1/2. Thus, the profit for product B would have
to be,
-9/c
2 =
1/2
c
2 =
18
If the profit for product B is increased to $15
the optimal solution point will not change,
although Z would change from $57 to $81.
If the profit for product B is increased to $20
the solution point will change from B to A,
x
1
= 0, x
2
= 5, Z = $100.
10.(a) For c
1
the upper limit is computed as,
c
1
/7 = 3
c
1 =
21
and the lower limit is,
c
1
/7 = 1/2
c
1 =
3.50
For c
2
the upper limit is,
9/c
2
= 1/2
c
2 = 18
and the lower limit is,
9/c
2
= 3
c
2
= 3
Summarizing,
3.50 c
1
21
3 c
2
18
0 5 10 15 20 25 30 35
x
x
1
Point B is optimal
B
C
A
5
10
15
20
25
30
2
A: x
1
= 0
x
2
= 5
Z = 35
*B: x
1
= 4
x
2
= 3
Z = 57
C: x
1
= 5
x
2
= 0
Z = 45
40
22
(b)
***** Input Data *****
Max. Z = 9x
1
+ 7x
2
Subject to
c
1
12x
1
+ 4x
2
60
c
2
4x
1
+ 8x
2
40
***** Program Output *****
Final Optimal Solution At Simplex Tableau : 2
Z = 57.000
Variable Value Reduced Cost
x
1
4.000 0.000
x
2
3.000 0.000
Constraint Slack/Surplus Shadow Price
c
1
0.000 0.550
c
2
0.000 0.600
Objective Coefficient Ranges
Lower Current Upper Allowable Allowable
Variables Limit Values Limit Increase Decrease
x
1
3.500 9.000 21.000 12.000 5.500
x
2
3.000 7.000 18.000 11.000 4.000
Right Hand Side Ranges
Lower Current Upper Allowable Allowable
Constraints Limit Values Limit Increase Decrease
c
1
20.000 60.000 120.000 60.000 40.000
c
2
20.000 40.000 120.000 80.000 20.000
***** End of Output *****
(c) The shadow price for line 1 time is $0.55 per
hour, while the shadow price for line 2 time is
$0.60 per hour. The company would prefer to
obtain more line 2 time since it would result in
the greatest increase in profit.
23
11. (a) x
1
= no. of yards of denim
x
2
= no. of yards of corduroy
maximize Z = $2.25x
1
+ 3.10x
2
subject to
5.0x
1
+ 7.5x
2
6,500
3.0x
1
+ 3.2x
2
3,000
x
2
510
x
1
, x
2
0
(b) maximize Z = $2.25x
1
+ 3.10x
2
+ 0s
1
+
0s
2
+ 0s
3
subject to
5.0x
1
+ 7.5x
2
+ s
1
= 6,500
3.0x
1
+ 3.2x
2
+ s
2
= 3,000
x
2
+ s
3
= 510
x
1
, x
2
, s
1
, s
2
, s
3
0
12.
(a)5.0(456) + 7.5(510) + s
1
= 6,500
s
1
= 6,500 6,105
s
1
= 395 lbs.
3.0(456) + 3.2(510) + s
2
= 3,000
s
2
= 0 hrs.
510 + s
3
= 510
s
3
= 0
therefore demand for corduroy is met.
(b) In order for the optimal solution point to
change from B to C the slope of the objective
function must be at least as great as the slope of
the constraint line, 3.0x
1
+ 3.2x
2
= 3,000, which
is 3/3.2. Thus, the profit for denim would have
to be,
c
1
/3.0 = 3/3.2
c
1
= 2.91
If the profit for denim is increased from $2.25
to $3.00 the optimal solution would change to
point C where x
1
= 1,000, x
2
= 0, Z = 3,000.
Profit for corduroy has no upper limit that
would change the optimal solution point.
(c)The constraint line for cotton would move
inward as shown in the following graph where
point C is optimal.
0 200 400 600 800 1000 1200 1400
x
x
1
B
C
A
200
400
600
800
1000
1200
1400
1600
2
A: x
1
= 0
x
2
= 510
Z = $1,581
*B: x
1
= 456
x
2
= 510
Z = $2,607
C: x
1
= 1,000
x
2
= 0
Z = $2,250
1600
0 200 400 600 800 1000 1200 1400
x
x
1
B C
D
A
200
400
600
800
1000
1200
1400
1600
2
x
1
= 1,000
x
2
= 0
Z = $2,250
1600
C, optimal
24
13.
***** Input Data *****
Max. Z = 2.25x
1
+ 3.1x
2
Subject to
c
1
5x
1
+ 7.5x
2
6500
c
2
3x
1
+ 3.2x
2
3000
c
2
1x
2
510
***** Program Output *****
Final Optimal Solution At Simplex Tableau : 2
Z = 2607.000
Variable Value Reduced Cost
x
1
456.000 0.000
x
2
510.000 0.000
Constraint Slack/Surplus Shadow Price
c
1
395.000 0.000
c
2
0.000 0.750
c
3
0.000 0.700
Objective Coefficient Ranges
Lower Current Upper Allowable Allowable
Variables Limit Values Limit Increase Decrease
x
1
0.000 2.250 2.906 0.656 2.250
x
2
2.400 3.100 No limit No limit 0.700
Right Hand Side Ranges
Lower Current Upper Allowable Allowable
Constraints Limit Values Limit Increase Decrease
c
1
6015.000 6500.000 No limit No limit 395.000
c
2
1632.000 3000.000 3237.000 237.000 1368.000
c
3
0.000 510.000 692.308 182.308 510.000
***** End of Output *****
(a)The company should select additional
processing time, with a shadow price of $0.75
per hour. Cotton has a shadow price of $0
because there is already extra (slack) cotton
available and not being used so any more would
have no marginal value.
25
(b) 0 c
1
2.906 6,105 q
1

2.4 c
2
1,632 q
2
3,237
0 q
3
692.308
The demand for corduroy can decrease to zero
or increase to 692.308 yds. without changing
the current solution mix of denim and
corduroy. If the demand increases beyond
692.308 yds., then denim would no longer be
produced and only corduroy would be
produced.
14. x
1
= no. of days to operate mill 1
x
2
= no. of days to operate mill 2
minimize Z = 6,000x
1
+ 7,000x
2
subject to
6x
1
+ 2x
2
12
2x
1
+ 2x
2
8
4x
1
+ 10x
2
5
x
1
, x
2
0
15.
(a) 6(4) + 2(0) s
1
= 12
s
1
= 12
2(4) + 2(0) s
2
= 8
s
2
= 0
4(4) + 10(0) s
3
= 5
s
3
= 11
(b)The slope of the objective function,
6000/7,000 must become flatter (i.e., less)
than the slope of the constraint line,
2x
1
+ 2x
2
= 8, for the solution to change. The
cost of operating Mill 1, c
1
, that would change
the solution point is,
c
1
/7,000 = 1
c
1
= 7,000
Since $7,500 > $7,000, the solution point will
change to B where x
1
= 1, x
2
= 3, Z = $28,500.
(c) If the constraint line for high-grade aluminum
changes to 6x
1
+ 2x
2
= 10, it moves inward but
does not change the optimal variable mix. B
remains optimal but moves to a new location,
x
1
= 0.5, x
2
= 3.5, Z = $27,500.
0 1 2 3 4 5 6 7
x
x
1
B
C
A
1
2
3
4
5
6
7
8
2
8
A: x
1
= 0
x
2
= 6
Z = 42,000
B: x
1
= 1
x
2
= 3
Z = 27,000
*C: x
1
= 4
x
2
= 0
Z = 24,000
26
16.
Z = 24000
Variable Value
x
1
4.000
x
2
0.000
Constraint Slack/Surplus Shadow Price
c
1
12.000 0.000
c
2
0.000 3000.000
c
3
11.000 0.000
Objective Coefficient Ranges
Lower Current Upper Allowable Allowable
Variables Limit Values Limit Increase Decrease
x
1
0.000 6000.000 7000.000 1000.000 6000.000
x
2
6000.000 7000.000 No limit No limit 1000.000
Right Hand Side Ranges
Lower Current Upper Allowable Allowable
Constraints Limit Values Limit Increase Decrease
c
1
No limit 12.000 24.000 12.000 No limit
c
2
4.000 8.000 No limit No limit 4.000
c
3
No limit 5.000 16.000 11.000 No limit
(a) There is surplus high-grade and low-grade
aluminum so the shadow price is $0 for both.
The shadow price for medium-grade aluminum
is $3,000 indicating that for every ton that this
constraint could be reduced, cost will decrease
by $3,000.
27
(b) 0 c
1
7,000 q
1
24
6,000 c
2
4 q
2

q
3
16
(c) There will be no change.
17. x
1
= no. of acres of corn
x
2
= no. of acres of tobacco
maximize Z = 300x
1
+ 520x
2
subject to
x
1
+ x
2
410
105x
1
+ 210x
2
52,500
x
2
100
x
1
, x
2
0
18.
(a) x
1
= 320, x
2
= 90
320 + 90 + s
1
= 410
s
1
= 0 acres uncultivated
90 + s
3
= 100
s
3
= 10 acres of tobacco allotment
unused
(b)At point D only corn is planted. In order for
point D to be optimal the slope of the objective
function will have to be at least as great
(i.e., steep) as the slope of the constraint line,
x
1
+ x
2
= 410, which is 1. Thus, the profit for
corn is computed as,
c/520 = 1
c
1
= 520
The profit for corn must be greater than $520
for the Bradleys to plant only corn.
(c)If the constraint line changes from
x
1
+ x
2
= 410 to x
1
+ x
2
= 510, it will move
outward to a location which changes the
solution to the point where 105x
1
+ 210x
2
=
52,500 intersects with the axis. This new point
is x
1
= 500, x
2
= 0, Z = $150,000.
(d)If the constraint line changes from
x
1
+ x
2
= 410 to x
1
+ x
2
= 360, it moves inward
to a location which changes the solution point
to the intersection of x
1
+ x
2
= 360 and
105x
1
+ 210x
2
= 52,500. At this point
x
1
= 260, x
2
= 100 and Z = $130,000.
0 100 200 300 400 500 600 700
x
x
1
B
C
A
100
200
300
400
500
600
2
800
A: x
1
= 0
x
2
= 100
Z = 52,000
B: x
1
= 300
x
2
= 100
Z = 142,000
*C: x
1
= 320
x
2
= 90
Z = 142,800
D: x
1
= 410
x
2
= 0
Z = 123,000
Point C is optimal
D
28
19.
***** Input Data *****
Max. Z = 300x
1
+ 520x
2
Subject to
c
1
1x
1
+ 1x
2
410
c
2
105x
1
+ 210x
2
52500
c
2
1x
2
100
***** Program Output *****
Z = 142800.000
Variable Value
x
1
320.000
x
2
90.000
Constraint Slack/Surplus Shadow Price
c
1
0.000 80.000
c
2
0.000 2.095
c
3
10.000 0.000
Objective Coefficient Ranges
Lower Current Upper Allowable Allowable
Variables Limit Values Limit Increase Decrease
x
1
260.000 300.000 520.000 220.000 40.000
x
2
300.000 520.000 600.000 80.000 220.000
Right Hand Side Ranges
Lower Current Upper Allowable Allowable
Constraints Limit Values Limit Increase Decrease
c
1
400.000 410.000 500.000 90.000 10.000
c
2
43050.000 52500.000 53550.000 1050.000 9450.000
c
3
90.000 100.000 No limit No limit 10.000
(a)No, the shadow price for land is $80 per acre
indicating that profit will increase by no more
than $80 for each additional acre obtained.
The maximum price the Bradleys should pay
is $80 and the most they should obtain is at the
upper limit of the sensitivity range for land.
This limit is 500 acres, or 90 additional acres.
Beyond 90 acres the shadow price would change.
29
(b)The shadow price for the budget is $2.095.
Thus, for every $1 dollar borrowed they could
expect a profit increase of $2.095. If they
borrowed $1,000 it would not change the
amount of corn and tobacco they plant since
the sensitivity range has a maximum allowable
increase of $1,050.
20. x
1
= no. of sausage biscuits
x
2
= no. of ham biscuits
maximize Z = .60x
1
+ .50x
2
subject to
.10x
1
30
.15 x
2
30
.04x
1
+ .04x
2
16
0..01x
1
+ .024x
2
6
x
1
, x
2
0
21.
(a)x
1
= 300, x
2
= 100, Z = $230
.10(300) + s
1
= 30
s
1
= 0 left over sausage
.15(100) + s
2
= 30
s
2
= 15 lbs. left over ham
.01(300) + .024(100) + s
4
= 6
s
4
= 0.6 hr.
(b)The slope of the objective function, 6/5, must
become flatter (i.e., less) than the slope of the
constraint line, .04x
1
+ .04x
2
= 16, for the
solution to change. The profit for ham, c
2
, that
would change the solution point is,
0.6/c
2
= 1
c
2
= .60
Thus, an increase in profit for ham of 0.60 will
create a second optimal solution point at C
where x
1
= 257, x
2
= 143 and Z = $225.70.
(Point D would also continue to be optimal,
i.e., multiple optimal solutions.)
(c)Achange in the constraint line from,
.04x
1
+ .04x
2
= 16 to .04x
1
+ .04x
2
= 18
would move the line outward, eliminating both
points C and D. The new solution point occurs
at the intersection of 0.01x
1
+ .024x
2
= 6 and
.10x = 30. This point is x
1
= 300, x
2
= 125, and
Z = $242.50.
22.
***** Input Data *****
Max. Z = .6x
1
+ .5x
2
Subject to
c
1
.1x
1
30
c
2
.15x
2
30
c
3
.04x
1
+ .04x
2
16
c
4
.01x
1
+ .024x
2
6
***** Program Output *****
Z = 230.000
Variable Value
x
1
300.000
x
2
100.000
Constraint Slack/Surplus Shadow Price
c
1
0.000 1.000
c
2
15.000 0.000
c
3
0.000 12.500
c
4
0.600 0.000
0 100 200 300 400 500 600 700
x
x
1
B
C
D
E
A
100
200
300
400
500
600
2
800
A: x
1
= 0
x
2
= 200
Z = 100
B: x
1
= 120
x
2
= 200
Z = 172
C: x
1
= 257
x
2
= 143
Z = 225.70
*D: x
1
= 300
x
2
= 100
Z = 230
E: x
1
= 300
x
2
= 0
Z = 180
Point D is optimal
30
Objective Coefficient Ranges
Lower Current Upper Allowable Allowable
Variables Limit Values Limit Increase Decrease
x
1
0.500 0.600 No limit No limit 0.100
x
2
0.000 0.500 0.600 0.100 0.500
Right Hand Side Ranges
Lower Current Upper Allowable Allowable
Constraints Limit Values Limit Increase Decrease
c
1
25.714 30.000 40.000 10.000 4.286
c
2
15.000 30.000 No limit No limit 15.000
c
3
12.000 16.000 17.000 1.000 4.000
c
4
5.400 6.000 No limit No limit 0.600
(a)The shadow price for sausage is $1. For every
additional pound of sausage that can be
obtained profit will increase by $1. The shadow
price for flour is $12.50. For each additional
pound of flour that can be obtained, profit will
increase by this amount. There are extra ham
and labor hours available, so their shadow
prices are zero, indicating additional amounts
of those resources would add nothing to profit.
(b)The constraint for flour, indicated by the high
shadow price.
(c) .50 c
1

25.714 q
1
40
The sensitivity range for profit indicates that
the optimal mix of sausage and ham biscuits
will remain optimal as long as profit does not
fall below $0.50. The sensitivity range for
sausage indicates the optimal solution mix will
be maintained as long as the available sausage is
between 25.714 and 40 lbs.
23. x
1
= no. of telephone interviewers
x
2
= no. of personal interviewers
minimize Z = 50x
1
+ 70x
2
subject to
80x
1
+ 40x
2
3,000
80x
1
1,000
40x
2
800
x
1
, x
2
0
31
24.
(a)The optimal point is at B where x
1
= 27.5 and
x
2
= 20. The slope of the objective function
50/70, must become greater (i.e., steeper) than
the slope of the constraint line, 80x
1
+ 40x
2
=
3,000, for the solution point to change from B
to A. The cost of a telephone interviewer that
would change the solution point is,
c
1
/70 = 2
c
1
= 140
This is the upper limit of the sensitivity range
for c
1
. The lower limit is 0 since as the slope of
the objective function becomes flatter, the
solution point will not change from B until the
objective function is parallel with the constraint
line. Thus,
0 c
1
140
Since the constraint line is vertical, it can
increase as far as point B and decrease all the
way to the x
2
axis before the solution mix will
change. At point B,
80(27.5) = q
1
q
1
= 2,200
At the axis,
80(0) = q
1
q
1
= 0
Summarizing,
0 q
1
2,200
(b)At the optimal point, B, x
1
= 27.5 and x
2
= 20.
80(27.5) s
2
= 1,000
s
2
= 1,200 extra telephone interviews
40(20) s
3
= 800
s
3
= 0
(c)Achange in the constraint line from
40x
2
= 800 to 40x
2
= 1,200, moves the line
up, but it does not change the optimal mix.
The new solution values are x
1
= 22.5, x
2
= 30,
Z = $3,225.
25.
***** Input Data *****
Min. Z = 50x
1
+ 70x
2
Subject to
c
1
80x
1
+ 40x
2
3000
c
2
80x
1
1000
c
3
40x
2
800
***** Program Output *****
Z = 2775.000
Variable Value
x
1
27.500
x
2
20.000
Constraint Slack/Surplus Shadow Price
c
1
0.000 0.625
c
2
1200.000 0.000
c
3
0.000 1.125
0 10 20 30 40 50 60 70
x
x
1
Point B is optimal
B
A
10
20
30
40
50
60
70
80
2
A: x
1
= 12.5
x
2
= 50
Z = 4,125
*B: x
1
= 27.5
x
2
= 20
Z = 2,775
32
Objective Coefficient Ranges
Lower Current Upper Allowable Allowable
Variables Limit Values Limit Increase Decrease
x
1
0.000 50.000 140.000 90.000 50.000
x
2
25.000 70.000 No limit No limit 45.000
Right Hand Side Ranges
Lower Current Upper Allowable Allowable
Constraints Limit Values Limit Increase Decrease
c
1
1800.000 3000.000 No limit No limit 1200.000
c
2
No limit 1000.000 2200.000 1200.000 No limit
c
3
0.000 800.000 2000.000 1200.000 800.000
(a)Reduce the personal interview requirement;
it will reduce cost by $0.625 per interview,
while a telephone interview will not reduce
cost; i.e., it has a shadow price equal to $0.
(b) 25 c
2

1,800 q
1

26. x
1
= no. of gallons of rye
x
2
= no. of gallons of bourbon
maximize Z = 3x
1
+ 4x
2
subject to
x
1
+ x
2
400
x
1
.4(x
1
+ x
2
)
x
2
250
x
1
= 2x
2
x
1
+ x
2
500
x
1
, x
2
0
33
27.
(a)Optimal solution at B: x
1
= 333.3 and
x
2
= 166.7
(333.3) + (166.7) s
1
= 400
s
1
= 100 extra gallons of
blended whiskey produced
.6(333.33) .4(166.7) s
2
= 0
s
2
= 133.3 extra
gallons of rye in
the blend
(166.7) + s
3
= 250
s
3
= 83.3 fewer gallons of
bourbon than the maximum
(333.3) + (166.7) + s
4
= 500
s
4
= 100 gallons of blend
production capacity left
over
(b)Because the solution space is not really an
area, but a line instead, the objective function
coefficients can change to any positive value
and the solution point will remain the same,
i.e., point B. Observing the graph of this model,
no matter how flatter or steeper the objective
function becomes, point B will remain optimal.
0 100 200 300 400 500 600 700
x
x
1
Point B is optimal
Feasible
solution line
Z
B
A 100
200
300
400
500
600
2
A: x
1
= 266.7
x
2
= 133.3
Z = 1,333.20
*B: x
1
= 333.3
x
2
= 166.7
Z = 1,666
28.
***** Input Data *****
Max. Z = 3x
1
+ 4x
2
Subject to
c
1
1x
1
+ 1x
2
400
c
2
.6x
1
.4x
2
0
c
3
1x
2
250
c
4
1x
1
2x
2
= 0
c
5
1x
1
+ 1x
2
500
***** Program Output *****
Z = 1666.667
Variable Value
x
1
333.333
x
2
166.667
Constraint Slack/Surplus Shadow Price
c
1
100.000 0.000
c
2
133.333 0.000
c
3
83.333 0.000
c
5
0.000 3.333
34
Objective Coefficient Ranges
Lower Current Upper Allowable Allowable
Variables Limit Values Limit Increase Decrease
x
1
2.000 3.000 No limit No limit 5.000
x
2
6.000 4.000 No limit No limit 10.000
Right Hand Side Ranges
Lower Current Upper Allowable Allowable
Constraints Limit Values Limit Increase Decrease
c
1
No limit 400.000 500.000 100.000 No limit
c
2
No limit 0.000 133.333 133.333 No limit
c
3
166.667 250.000 No limit No limit 83.333
c
4
250.000 0.000 500.000 500.000 250.000
c
5
400.000 500.000 750.000 250.000 100.000
(a)2.0 c
1

6.0 c
2

Because there is only one effective solution
point the objective function can take on any
negative (downward) slope and the solution
point will not change. Only negative
coefficients that result in a positive slope will
move the solution to point A, however, this
would be unrealistic.
(b)The shadow price for production capacity is
$3.33. Thus, for each gallon increase in capacity
profit will increase by $3.33.
(c)This new specification changes the constraint,
x
1
2x
2
= 0, to x
1
3x
2
= 0. This change to a
constraint coefficient cannot be evaluated with
normal sensitivity analysis. Instead the model
must be solved again on the computer, which
results in the following solution output.
35
***** Input Data *****
Max. Z = 3x
1
+ 4x
2
Subject to
c
1
1x
1
+ 1x
2
400
c
2
.6x
1
.4x
2
0
c
3
1x
2
250
c
4
1x
1
3x
2
= 0
c
5
1x
1
+ 1x
2
500
***** Program Output *****
Z = 1625.000
Variable Value
x
1
375.000
x
2
125.000
Constraint Slack/Surplus Shadow Price
c
1
100.000 0.000
c
2
175.000 0.000
c
3
125.000 0.000
c
5
0.000 3.250
Objective Coefficient Ranges
Lower Current Upper Allowable Allowable
Variables Limit Values Limit Increase Decrease
x
1
1.333 3.000 No limit No limit 4.333
x
2
9.000 4.000 No limit No limit 13.000
Right Hand Side Ranges
Lower Current Upper Allowable Allowable
Constraints Limit Values Limit Increase Decrease
c
1
No limit 400.000 500.000 100.000 No limit
c
2
No limit 0.000 175.000 175.000 No limit
c
3
125.000 250.000 No limit No limit 125.000
c
4
500.000 0.000 500.000 500.000 500.000
c
5
400.000 500.000 1000.000 500.000 100.000