Linear Programming Sensitivity Analysis: © 2007 Pearson Education
Linear Programming Sensitivity Analysis: © 2007 Pearson Education
Linear Programming
Sensitivity Analysis
1. An OFC changes, or
2. A RHS changes
8
Max X7 T + 5 C (profit)
Clearly profit goes up, but would we want to
make more tables and less chairs?
(i.e. Does the optimal solution change?)
Characteristics of OFC Changes
• There is no effect on the feasible region
200
Feasible
100
Region
0
0 100 200 300 400 500 T
C
1000
What if the OFC
became higher? Both have new
Or lower? optimal corner
points
11T + 5C = $5500 600
Optimal Solution 450
(T=500, C=0)
3T + 5C = $2850
Optimal Solution Feasible
(T=200, C=450) Region
0
0 100 500 800 T
• There is a range for each OFC where the
current optimal corner point remains
optimal.
2T
Profit=$4820
2T
Original
+
1C
+1C
100 Feasible
=1
=1
00
0
300
Region
0
Go to file 4-1.xls
Constraint RHS Changes
If the change in the RHS value is within the
allowable range, then:
• The shadow price does not change
• The change in objective function value =
(shadow price) x (RHS change)
Go to file 4-2.xls
RHS Change Questions
• What if the supply of nonelectrical
components changes?
RHS Example
• Electrical components decrease 500
500 / 950 = 0.5263
• Assembly hours increase 200
200 / 466.67 = 0.4285
0.9548
The sensitivity report can still be used
Pricing New Variables
Suppose they are considering selling a new
product, Home Theater Systems (HTS)
Go to file 4-3.xls
Sensitivity Analysis for
a Minimization Problem
Burn-Off makes a “miracle” diet drink