Spreadsheet Modeling

& Decision Analysis

A Practical Introduction to
Management Science
5th edition

Cliff T. Ragsdale
 Chapter 4

Sensitivity Analysis and

the Simplex Method
 Introduction
 When solving an LP problem we assume
that values of all model coefficients are
known with certainty.
 Such certainty rarely exists.
 Sensitivity analysis helps answer
questions about how sensitive the optimal
solution is to changes in various
coefficients in a model.
 General Form of a
Linear Programming (LP) Problem
MAX (or MIN): c1X1 + c2X2 + … + cnXn
Subject to: a11X1 + a12X2 + … + a1nXn <= b1
:
ak1X1 + ak2X2 + … + aknXn <= bk
:
am1X1 + am2X2 + … + amnXn = bm

 How sensitive is a solution to changes in

the ci, aij, and bi?
 Approaches to Sensitivity Analysis

 Change the data and re-solve the model!

– Sometimes this is the only practical
approach.
 Solver also produces sensitivity reports
that can answer various questions…
 Solver’s Sensitivity Report
 Answers questions about:
– Amounts by which objective function
coefficients can change without changing the
optimal solution.
– The impact on the optimal objective function
value of changes in constrained resources.
– The impact on the optimal objective function
value of forced changes in decision variables.
– The impact changes in constraint coefficients
will have on the optimal solution.
 Software Note

When solving LP problems, be sure to select the

“Assume Linear Model” option in the Solver
Options dialog box as this allows Solver to provide
more sensitivity information than it could otherwise
do.
 Once Again, We’ll Use The
Blue Ridge Hot Tubs Example...

MAX: 350X1 + 300X2 } profit

S.T.: 1X1 + 1X2 <= 200} pumps
9X1 + 6X2 <= 1566 } labor
12X1 + 16X2 <= 2880 } tubing
X1, X2 >= 0 } nonnegativity
The Answer Report

See file Fig4-1.xls

The Sensitivity Report

See file Fig4-1.xls

 How Changes in Objective Coefficients
X2 Change the Slope of the Level Curve
250
original level curve

200
new optimal solution

150
original optimal solution

100
new level curve

50

0
0 50 100 150 200 250 X1
How Changes in Objective Coefficients
Change the Slope of the Level Curve

See file Fig4-4.xls

 Changes in
Objective Function Coefficients
Values in the “Allowable Increase” and
“Allowable Decrease” columns for the
Changing Cells indicate the amounts by
which an objective function coefficient can
change without changing the optimal
solution, assuming all other coefficients
remain constant.
 Alternate Optimal Solutions

Values of zero (0) in the “Allowable

Increase” or “Allowable Decrease”
columns for the Changing Cells indicate
that an alternate optimal solution exists.
 Changes in Constraint RHS Values
 The shadow price of a constraint indicates the
amount by which the objective function value
changes given a unit increase in the RHS value of
the constraint, assuming all other coefficients
remain constant.
 Shadow prices hold only within RHS changes
falling within the values in “Allowable Increase” and
“Allowable Decrease” columns.
 Shadow prices for nonbinding constraints are
always zero.
 Comments About Changes
in Constraint RHS Values
 Shadow prices only indicate the changes that occur
in the objective function value as RHS values
change.
 Changing a RHS value for a binding constraint also
changes the feasible region and the optimal
solution (see graph on following slide).
 To find the optimal solution after changing a
binding RHS value, you must re-solve the problem.
 How Changing an RHS Value Can Change
the Feasible Region and Optimal Solution
X2
250

Suppose available labor hours

200 increase from 1,566 to 1,728.

150 old optimal solution

old labor constraint

100

new optimal solution

50
new labor constraint

0
0 50 100 150 200 250 X1
How Changing an RHS Value Can Change
the Feasible Region and Optimal Solution

See file Fig4-4.xls

 Other Uses of Shadow Prices

 Suppose a new Hot Tub (the Typhoon-Lagoon) is

being considered. It generates a marginal profit of
$320 and requires:
– 1 pump (shadow price = $200)
– 8 hours of labor (shadow price = $16.67)
– 13 feet of tubing (shadow price = $0)
 Q: Would it be profitable to produce any?
A: $320 - $200*1 - $16.67*8 - $0*13 = -$13.33 = No!
Typhoon-Lagoon Sensitivity
See file Fig. 4-8

4-20
 The Meaning of Reduced Costs

 The reduced cost for each product equals its

per-unit marginal profit minus the per-unit
value of the resources it consumes (priced at
their shadow prices).

Optimal Value of Optimal Value of

Type of Problem Decision Variable Reduced Cost
at simple lower bound <=0
Maximization between lower & upper bounds =0
at simple upper bound >=0

at simple lower bound >=0

Minimization between lower & upper bounds =0
at simple upper bound <=0
 Key Points - I
 The shadow prices of resources equate the
marginal value of the resources consumed
with the marginal benefit of the goods being
produced.
 Resources in excess supply have a shadow
price (or marginal value) of zero.
 Key Points-II
 The reduced cost of a product is the difference
between its marginal profit and the marginal
value of the resources it consumes.
 Products whose marginal profits are less than
the marginal value of the goods required for
their production will not be produced in an
optimal solution.
 Analyzing Changes in
Constraint Coefficients
 Q: Suppose a Typhoon-Lagoon required only 7
labor hours rather than 8. Is it now profitable
to produce any?
A: $320 - $200*1 - $16.67*7 - $0*13 = $3.31 = Yes!
 Q: What is the maximum amount of labor
Typhoon-Lagoons could require and still be
profitable?
A: We need $320 - $200*1 - $16.67*L3 - $0*13 >=0
The above is true if L3 <= $120/$16.67 = $7.20
Simultaneous Changes in Objective
Function Coefficients
 The 100% Rule can be used to determine if the
optimal solutions changes when more than one
objective function coefficient changes.
 Two cases can occur:
– Case 1: All variables with changed obj.
coefficients have nonzero reduced costs.
– Case 2: At least one variable with changed
obj. coefficient has a reduced cost of zero.
 Simultaneous Changes in Objective
Function Coefficients: Case 1

(All variables with changed obj. coefficients have

nonzero reduced costs.)

 The current solution remains optimal

provided the obj. coefficient changes
are all within their Allowable Increase
or Decrease.
 Simultaneous Changes in
Objective Function Coefficients: Case 2
(At least one variable with changed obj. coefficient
has a reduced cost of zero.)
 c j
 , if c j  0
 I j
 For each variable compute: rj  
 c j

 D , if c j < 0
 j

 If more than one objective function coefficient

changes, the current solution remains optimal
provided the rj sum to <= 1.
 If the rj sum to > 1, the current solution, might
remain optimal, but this is not guaranteed.
 A Warning About Degeneracy
 The solution to an LP problem is degenerate if the
Allowable Increase of Decrease on any constraint
is zero (0).
 When the solution is degenerate:
1. The methods mentioned earlier for detecting
alternate optimal solutions cannot be relied upon.
2. The reduced costs for the changing cells may not be
unique. Also, the objective function coefficients for
changing cells must change by at least as much as
(and possibly more than) their respective reduced
costs before the optimal solution would change.
 When the solution is degenerate (cont’d):
3. The allowable increases and decreases for the
objective function coefficients still hold and, in fact,
the coefficients may have to be changed beyond the
allowable increase and decrease limits before the
optimal solution changes.
4. The given shadow prices and their ranges may still
be interpreted in the usual way but they may not be
unique. That is, a different set of shadow prices and
ranges may also apply to the problem (even if the
optimal solution is unique).
The Limits Report

See file Fig4-1.xls

 The Sensitivity Assistant
 An add-in on the CD-ROM for this book that
allows you to create:
– Spider Tables & Plots
Summarize the optimal value for one output cell
as individual changes are made to various input
cells.
– Solver Tables
Summarize the optimal value of multiple output
cells as changes are made to a single input cell.
The Sensitivity Assistant

See files:
Fig4-12.xls
&
Fig4-14.xls
 The Simplex Method
 To use the simplex method, we first convert all
inequalities to equalities by adding slack
variables to <= constraints and subtracting slack
variables from >= constraints.
For example: ak1X1 + ak2X2 + … + aknXn <= bk
converts to: ak1X1 + ak2X2 + … + aknXn + Sk = bk

And: ak1X1 + ak2X2 + … + aknXn >= bk

converts to: ak1X1 + ak2X2 + … + aknXn - Sk = bk
 For Our Example Problem...
MAX: 350X1 + 300X2 } profit
S.T.: 1X1 + 1X2 + S1 = 200 } pumps
9X1 + 6X2 + S2 = 1566 } labor
12X1 + 16X2 + S3 = 2880 } tubing
X1, X2, S1, S2, S3 >= 0 } nonnegativity

 If there are n variables in a system of m equations

(where n>m) we can select any m variables and
solve the equations (setting the remaining n-m
variables to zero.)
Possible Basic Feasible Solutions
Basic Nonbasic Objective
Variables Variables Solution Value
1 S1, S2, S3 X1 , X 2 X1=0, X2=0, S1=200, S2=1566, S3=2880 0
2 X1, S1, S3 X 2 , S2 X1=174, X2=0, S1=26, S2=0, S3=792 60,900
3 X1, X2, S3 S1, S2 X1=122, X2=78, S1=0, S2=0, S3=168 66,100
4 X1, X2, S2 S1, S3 X1=80, X2=120, S1=0, S2=126, S3=0 64,000
5 X2, S1, S2 X 1 , S3 X1=0, X2=180, S1=20, S2=486, S3=0 54,000
6* X1, X2, S1 S2, S3 X1=108, X2=99, S1=-7, S2=0, S3=0 67,500
7* X1, S1, S2 X 2 , S3 X1=240, X2=0, S1=-40, S2=-594, S3=0 84,000
8* X1, S2, S3 X 2 , S1 X1=200, X2=0, S1=0, S2=-234, S3=480 70,000
9* X2, S2, S3 X 1 , S1 X1=0, X2=200, S1=0, S2=366, S3=-320 60,000
10* X2, S1, S3 X1, S2 X1=0, X2=261, S1=-61, S2=0, S3=-1296 78,300
* denotes infeasible solutions
 Basic Feasible Solutions &
Extreme Points
X2
250
Basic Feasible Solutions
1 X1=0, X2=0, S1=200, S2=1566, S3=2880

5 2 X1=174, X2=0, S1=26, S2=0, S3=792

200
3 X1=122, X2=78, S1=0, S2=0, S3=168
4 X1=80, X2=120, S1=0, S2=126, S3=0
150
4 5 X1=0, X2=180, S1=20, S2=486, S3=0

100
3

50
1 2
0
0 50 100 150 200 250 X1
 Simplex Method Summary
 Identify any basic feasible solution (or extreme
point) for an LP problem, then moving to an
adjacent extreme point, if such a move improves
the value of the objective function.
 Moving from one extreme point to an adjacent one
occurs by switching one of the basic variables with
one of the nonbasic variables to create a new
basic feasible solution (for an adjacent extreme
point).
 When no adjacent extreme point has a better
objective function value, stop -- the current
extreme point is optimal.
End of Chapter 4