Scribd
Upload
14 views

3.1+ (PPT) +Linear+Programming+ +Sensitivity+Analysis

Uploaded by

absidyco
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
14 views

3.1+ (PPT) +Linear+Programming+ +Sensitivity+Analysis

Uploaded by

absidyco
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 17

Linear Programming:

Sensitivity Analysis
We call it “post-optimality” because
we normally do sensitivity analysis
“after” getting the optimal solution

Introduction
• Sensitivity analysis (or post-optimality analysis) is used to
determine how the optimal solution is affected by changes,
within specified ranges, in:
• the objective function coefficients
• the right-hand side (RHS) values
• Sensitivity analysis allows a manager to ask certain what-if
questions about the problem.
Range of Optimality
Example: If Objective Function is:

Range of Optimality Max 5x + 7y

Then how much could 5 and 7 change


• Let us consider how changes in the objective function
without changing the optimal solution

coefficients might affect the optimal solution.


• The range of optimality for each coefficient provides the
range of values over which the current solution will remain
optimal.
• Managers should focus on those objective coefficients that
have a narrow range of optimality and coefficients near the
endpoints of the range.
Example:
Max 5x + 7y
s.t. x < 6
2x + 3y < 19
x+ y < 8
x, y > 0

Note to self: solve here manually


Graphical Solution:
Example
• Changing Slope of Objective Function
y
8 x+y < 8
7 constraint line

6 Objective function
5 line for 5x + 7y = 46
5
4
3 Feasible 2x + 3y < 19
4 constraint line
2 Region
3
1
1 2
x
1 2 3 4 5 6 7 8 9 10
Get the slope of: (i.e. get the ‘m’ in y = mx + b)
Binding Constraint 1 Binding Constraint 2 Objective Function

x +y <8 2x + 3y < 19 5x + 7y = 46

-1/1 -2/3 -5/7


Note to self: solve here manually
What does this mean?
• This means that the slope of the objective function must not
exceed the range of the slopes of the binding constraints:
Now we can get the range of optimality:
• The range of optimality can be expressed as:
• Range of optimality of x
• The range as to which x value can change but the optimal
solution will stay the same.
• Range of optimality of y
• The range as to which y value can change but the optimal
solution will stay the same.
Range of optimality of x
• Just change the value of x into variable x, then solve for x:
Hint: solve first the left side, then the right side:

Note to self: solve here manually


Range of optimality of y
• Just change the value of y into variable y, then solve for y:
Hint: solve first the left side, then the right side:

Note to self: solve here manually


Important Note:
The range of optimality for x and y can only be used if only ONE variable has changed
value. So for example, if we want to interpret the range of optimality of x, then y
must STAY THE SAME.
What if BOTH x and y has changed?
Then use the slopes. Substitute x and y to the slope of the objective function and
determine if it exceeded such or not. Using the previous example, determine if
the optimal solution is the same if x increased to 7 and y decreased to 5

Now, let’s
try some
exercises!

Note to self: solve here manually


Exercise: Get the range of optimality for x and y:
Max 3x + 2y
s.t. x + y < 10
3x + y < 24
x + 2y < 16
x, y > 0
o w P r i c e a n d
Sh a d y
o f F e a s i b i l i t
Rang e
Shadow Price and Range of Feasibility
• Let us consider how a change in the right-hand side for a constraint
might affect the feasible region and perhaps cause a change in the
optimal solution.
• The improvement in the value of the optimal solution per unit increase
in the right-hand side is called the shadow price.
• The range of feasibility is the range over which the shadow price is
applicable.
• As the RHS increases, other constraints will become binding and limit
the change in the value of the objective function.
It’s hard to solve for the range of feasibility manually, so… we won’t.
However, a computer solution is possible. I’ll post it under Appendices
so you can check them out if you’re interested. 
Email: [email protected]

References:

Management Science by Ansderson

You might also like