SlideShare une entreprise Scribd logo
1  sur  37
Chapter 4:
Linear Programming
Sensitivity Analysis

© 2007 Pearson Education
What if there is uncertainly about one or
more values in the LP model?
Sensitivity analysis allows us to determine
how “sensitive” the optimal solution is to
changes in data values.
This includes analyzing changes in:
1. An Objective Function Coefficient (OFC)
2. A Right Hand Side (RHS) value of a
constraint
Graphical Sensitivity Analysis
We can use the graph of an LP to see what
happens when:
1. An OFC changes, or
2. A RHS changes
Recall the Flair Furniture problem
Flair Furniture Problem
Max 7T + 5C

(profit)

Subject to the constraints:

3T + 4C < 2400

(carpentry hrs)

2T + 1C < 1000

(painting hrs)

C < 450
T

(max # chairs)

> 100

(min # tables)

T, C > 0

(nonnegativity)
Objective Function
Coefficient (OFC) Changes
What if the profit contribution for tables
changed from $7 to $8 per table?

8
Max X T + 5 C
7

(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
• The slope of the level profit line changes
• If the slope changes enough, a different
corner point will become optimal
C

Original
Objective Function
7T + 5 C = $4040
Revised
Objective Function
8T + 5 C = $4360

Optimal Corner
(T=320, C=360)
Still optimal

500

400

300

200

Feasible
Region

100

0
0

100

200

300

400

500 T
What if the OFC
became higher?
Or lower?
11T + 5C = $5500
Optimal Solution
(T=500, C=0)

C
1000

Both have new
optimal corner
points
600
450

3T + 5C = $2850
Optimal Solution
(T=200, C=450)

Feasible
Region
0

0 100

500

800 T
• There is a range for each OFC where the
current optimal corner point remains
optimal.
• If the OFC changes beyond that range a
new corner point becomes optimal.
• Excel’s Solver will calculate the OFC
range.
Right Hand Side (RHS) Changes
What if painting hours available changed
from 1000 to 1300?

X

2T + 1C < 1000

1300
(painting hrs)

This increase in resources could allow us to
increase production and profit.
Characteristics of RHS Changes
• The constraint line shifts, which could
change the feasible region
• Slope of constraint line does not change
• Corner point locations can change
• The optimal solution can change
Old optimal
corner point
(T=320,C=360)
Profit=$4040

C
500

Feasible region
becomes larger

400

New optimal
corner point
(T=560,C=180)
Profit=$4820

300

100

200

300

400

500

300
=1

0
00

Region
0

1C

=1

Feasible

0

+
2T

100

1C

Original

+
2T

200

600 T
Effect on Objective Function Value
New profit
Old profit
Profit increase

= $4,820
= $4,040
= $780 from 300 additional
painting hours

$2.60 in profit per hour of painting
• Each additional hour will increase profit by $2.60
• Each hour lost will decrease profit by $2.60
Shadow Price
The change is the objective function
value per one-unit increase in the
RHS of the constraint.
Will painting hours be worth $2.60 per
hour regardless of many hours are
available ?
Range of Shadow Price Validity
Beyond some RHS range the value of each
painting hour will change.
While the RHS stays within this range, the
shadow price does not change.
Excel will calculate this range as well as the
shadow price.
Solver’s Sensitivity Report
When Excel Solver is used to find an
optimal solution, the option of generating
the “Sensitivity Report” is available.

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)
If the RHS change goes beyond the
allowable range, then the shadow price
will change.
Objective Function
Coefficient (OFC) Changes
If the change in OFC is within the allowable
range, then:
• The optimal solution does not change
• The new objective function value can be
calculated
Anderson Electronics Example
Decision: How many of each of 4 products
to make?
Objective: Maximize profit
Decision Variables:
V = number of VCR’s
S = number of stereos
T = number of TV’s
D = number of DVD players
Max 29V + 32S + 72T + 54D (in $ of profit)
Subject to the constraints:

3V + 4S + 4T + 3D < 4700
2V + 2S + 4T + 3D < 4500
V + S + 3T + 2D < 2500
V, S, T, D > 0
Go to file 4-2.xls

(elec. components)
(nonelec. components)

(assembly hours)
(nonnegativity)
RHS Change Questions
• What if the supply of nonelectrical
components changes?
• What happens if the supply of electrical
components
– increased by 400 (to 5100)?
– increased by 4000 (to 8700)?
• What if we could buy an additional 400
elec. components for $1 more than usual?
Would we want to buy them?
• What if would could get an additional 250
hours of assembly time by paying $5 per
hour more than usual? Would this be
profitable?
Decision Variables That Equal 0
We are not currently making any VCR’s
(V=0) because they are not profitable
enough.
How much would profit need to increase
before we would want to begin making
VCR’s?
Reduced Cost
of a Decision Variable
(marginal contribution to the obj. func. value)

- (marginal value of resources used)
= Reduced Cost
marginal profit of a VCR
= $29
- marginal value of resources = ?
Reduced Cost of a VCR

= - $1.0
Reduced Cost is:
• The minimum amount by which the OFC
of a variable should change to cause that
variable to become non-zero.
• The amount by which the objective
function value would change if the variable
were forced to change from 0 to 1.
OFC Change Questions
• For what range of profit contributions for
DVD players will the current solution
remain optimal?
• What happens to profit if this value drops
to $50 per DVD player?
Alternate Optimal Solutions
May be present when there are 0’s in
the Allowable Increase or Allowable
Decrease values for OFC values.
Simultaneous Changes
All changes discussed up to this point have
involved only 1 change at a time.
What if several OFC’s change?
Or
What if several RHS’s change?
Note: they cannot be mixed
The 100% Rule
∑ (change / allowable change) < 1
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)
Need to determine whether making HTS’s
would be sufficiently profitable
Producing HTS’s would take limited
resources away from other products
• To produce one HTS requires:
5 electrical components
4 nonelectrical components
4 hours of assembly time
• Can shadow prices be used to calculate
reduction in profit from other products?
(check 100% rule)
5/950 + 4/560 + 4/1325 = 0.015 < 1
Required Profit Contribution per HTS
elec cpnts
5 x $ 2 = $10
nonelec cpnts 4 x $ 0 = $ 0
assembly hrs 4 x $24 = $96
$106
Shadow
Prices

Making 1 HTS will reduce profit (from other
products) by $106
• Need (HTS profit contribution) > $106
• Cost to produce each HTS:
elec cpnts 5 x $ 7 = $35
nonelec cpnts
4 x $ 5 = $20
assembly hrs4 x $10 = $40
$95
(HTS profit contribution) = (selling price) - $95
So selling price must be at least $201
Is HTS Sufficiently Profitable?
• Marketing estimates that selling price
should not exceed $175
• Producing one HTS will cause profit to fall
by $26 ($201 - $175)
Go to file 4-3.xls
Sensitivity Analysis for
a Minimization Problem
Burn-Off makes a “miracle” diet drink
Decision: How much of each of 4
ingredients to use?
Objective: Minimize cost of ingredients
Data
Units of Chemical per Ounce of Ingredient
Ingredient

X

A
3

B
4

C
8

D
10

> 280 units

Y

5

3

6

6

> 200 units

Z

10

25

20

40

< 1050 units

Chemical

$ per ounce of ingredient
$0.40

$0.20

$0.60

$0.30

Requirement
Min 0.40A + 0.20B + 0.60C + 0.30D

($ of

cost)
Subject to the constraints

A+B+C+D

> 36 (min daily ounces)

3A + 4B + 8C + 10D

> 280 (chem x min)

5A + 3B + 6C + 6D

> 200 (chem y min)

10A + 25B + 20C + 40D < 280 (chem z max)
A, B, C, > 0
Go to file 4-5.xls

Contenu connexe

Tendances

Linear progarmming part 1
Linear progarmming   part 1Linear progarmming   part 1
Linear progarmming part 1Divya K
 
Linear programming
Linear programmingLinear programming
Linear programminggoogle
 
Amortized analysis
Amortized analysisAmortized analysis
Amortized analysisajmalcs
 
Greedy method1
Greedy method1Greedy method1
Greedy method1Rajendran
 
integral calculus and it’s uses in different fields.
 integral calculus and it’s uses in different fields. integral calculus and it’s uses in different fields.
integral calculus and it’s uses in different fields.kamrul_Hasan
 
Production & Operation Management Chapter32[1]
Production & Operation Management Chapter32[1]Production & Operation Management Chapter32[1]
Production & Operation Management Chapter32[1]Hariharan Ponnusamy
 
Operational Research
Operational ResearchOperational Research
Operational ResearchBrendaGaytan6
 
Amortized complexity
Amortized complexityAmortized complexity
Amortized complexityparamita30
 
LONG RUN PRODUCTION FUNCTION
LONG RUN PRODUCTION FUNCTIONLONG RUN PRODUCTION FUNCTION
LONG RUN PRODUCTION FUNCTIONimran khan
 

Tendances (17)

Linear progarmming part 1
Linear progarmming   part 1Linear progarmming   part 1
Linear progarmming part 1
 
Linear programming
Linear programmingLinear programming
Linear programming
 
09. amortized analysis
09. amortized analysis09. amortized analysis
09. amortized analysis
 
Amortized analysis
Amortized analysisAmortized analysis
Amortized analysis
 
Amortized
AmortizedAmortized
Amortized
 
Greedy method1
Greedy method1Greedy method1
Greedy method1
 
Algorithms - "quicksort"
Algorithms - "quicksort"Algorithms - "quicksort"
Algorithms - "quicksort"
 
Chap4
Chap4Chap4
Chap4
 
Algorithms - "heap sort"
Algorithms - "heap sort"Algorithms - "heap sort"
Algorithms - "heap sort"
 
Greedy method
Greedy method Greedy method
Greedy method
 
integral calculus and it’s uses in different fields.
 integral calculus and it’s uses in different fields. integral calculus and it’s uses in different fields.
integral calculus and it’s uses in different fields.
 
Production & Operation Management Chapter32[1]
Production & Operation Management Chapter32[1]Production & Operation Management Chapter32[1]
Production & Operation Management Chapter32[1]
 
Operational Research
Operational ResearchOperational Research
Operational Research
 
Amortized complexity
Amortized complexityAmortized complexity
Amortized complexity
 
Session 4
Session 4Session 4
Session 4
 
LONG RUN PRODUCTION FUNCTION
LONG RUN PRODUCTION FUNCTIONLONG RUN PRODUCTION FUNCTION
LONG RUN PRODUCTION FUNCTION
 
Theory of Production
Theory of ProductionTheory of Production
Theory of Production
 

Similaire à Chapter 4

Sensitivity analysis of LP chapter 4.ppt
Sensitivity analysis of LP chapter 4.pptSensitivity analysis of LP chapter 4.ppt
Sensitivity analysis of LP chapter 4.pptJagatShrestha4
 
Chapter 2.ppt
Chapter 2.pptChapter 2.ppt
Chapter 2.pptEbsaAbdi
 
POST OPTIMALITY ANALYSIS.doc
POST OPTIMALITY ANALYSIS.docPOST OPTIMALITY ANALYSIS.doc
POST OPTIMALITY ANALYSIS.docAbebaw Mamaru
 
Cost revenue analysis 1
Cost revenue analysis 1Cost revenue analysis 1
Cost revenue analysis 1Janak Secktoo
 
Econ789 chapter009
Econ789 chapter009Econ789 chapter009
Econ789 chapter009sakanor
 
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)Muhammed Jiyad
 
Costs separation copy.ppt
Costs separation copy.pptCosts separation copy.ppt
Costs separation copy.pptssuserc964b1
 
Principles_of_Managerial_Economics_-_Yahya_Alshehhi
Principles_of_Managerial_Economics_-_Yahya_AlshehhiPrinciples_of_Managerial_Economics_-_Yahya_Alshehhi
Principles_of_Managerial_Economics_-_Yahya_AlshehhiYahya Alshehhi
 
Industrial plant optimization in reduced dimensional spaces
Industrial plant optimization in reduced dimensional spacesIndustrial plant optimization in reduced dimensional spaces
Industrial plant optimization in reduced dimensional spacesCapstone
 
chapter 2 revised.pptx
chapter 2 revised.pptxchapter 2 revised.pptx
chapter 2 revised.pptxDejeneDay
 
chapter 2 revised.pptx
chapter 2 revised.pptxchapter 2 revised.pptx
chapter 2 revised.pptxDejeneDay
 
Linear programming 1
Linear programming 1Linear programming 1
Linear programming 1Rezaul Karim
 
OR-I_Lecture_Note_01.pptx
OR-I_Lecture_Note_01.pptxOR-I_Lecture_Note_01.pptx
OR-I_Lecture_Note_01.pptxssuserf19f3e
 
Production Slides (F).ppt
Production Slides (F).pptProduction Slides (F).ppt
Production Slides (F).pptsadiqfarhan2
 

Similaire à Chapter 4 (20)

Sensitivity analysis of LP chapter 4.ppt
Sensitivity analysis of LP chapter 4.pptSensitivity analysis of LP chapter 4.ppt
Sensitivity analysis of LP chapter 4.ppt
 
Chapter 2.ppt
Chapter 2.pptChapter 2.ppt
Chapter 2.ppt
 
Chapter 2.ppt
Chapter 2.pptChapter 2.ppt
Chapter 2.ppt
 
Reference 1
Reference 1Reference 1
Reference 1
 
Lpp 2.1202.ppts
Lpp 2.1202.pptsLpp 2.1202.ppts
Lpp 2.1202.ppts
 
POST OPTIMALITY ANALYSIS.doc
POST OPTIMALITY ANALYSIS.docPOST OPTIMALITY ANALYSIS.doc
POST OPTIMALITY ANALYSIS.doc
 
Cost revenue analysis 1
Cost revenue analysis 1Cost revenue analysis 1
Cost revenue analysis 1
 
Econ789 chapter009
Econ789 chapter009Econ789 chapter009
Econ789 chapter009
 
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
 
Costs separation copy.ppt
Costs separation copy.pptCosts separation copy.ppt
Costs separation copy.ppt
 
Principles_of_Managerial_Economics_-_Yahya_Alshehhi
Principles_of_Managerial_Economics_-_Yahya_AlshehhiPrinciples_of_Managerial_Economics_-_Yahya_Alshehhi
Principles_of_Managerial_Economics_-_Yahya_Alshehhi
 
Industrial plant optimization in reduced dimensional spaces
Industrial plant optimization in reduced dimensional spacesIndustrial plant optimization in reduced dimensional spaces
Industrial plant optimization in reduced dimensional spaces
 
Ch 04
Ch 04Ch 04
Ch 04
 
LPILP Models-1.ppt
LPILP Models-1.pptLPILP Models-1.ppt
LPILP Models-1.ppt
 
chapter 2 revised.pptx
chapter 2 revised.pptxchapter 2 revised.pptx
chapter 2 revised.pptx
 
chapter 2 revised.pptx
chapter 2 revised.pptxchapter 2 revised.pptx
chapter 2 revised.pptx
 
CH1.ppt
CH1.pptCH1.ppt
CH1.ppt
 
Linear programming 1
Linear programming 1Linear programming 1
Linear programming 1
 
OR-I_Lecture_Note_01.pptx
OR-I_Lecture_Note_01.pptxOR-I_Lecture_Note_01.pptx
OR-I_Lecture_Note_01.pptx
 
Production Slides (F).ppt
Production Slides (F).pptProduction Slides (F).ppt
Production Slides (F).ppt
 

Dernier

2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...Martijn de Jong
 
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...apidays
 
How to convert PDF to text with Nanonets
How to convert PDF to text with NanonetsHow to convert PDF to text with Nanonets
How to convert PDF to text with Nanonetsnaman860154
 
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptxHampshireHUG
 
Breaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path MountBreaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path MountPuma Security, LLC
 
A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)Gabriella Davis
 
Partners Life - Insurer Innovation Award 2024
Partners Life - Insurer Innovation Award 2024Partners Life - Insurer Innovation Award 2024
Partners Life - Insurer Innovation Award 2024The Digital Insurer
 
Handwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsHandwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsMaria Levchenko
 
Developing An App To Navigate The Roads of Brazil
Developing An App To Navigate The Roads of BrazilDeveloping An App To Navigate The Roads of Brazil
Developing An App To Navigate The Roads of BrazilV3cube
 
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...Drew Madelung
 
A Call to Action for Generative AI in 2024
A Call to Action for Generative AI in 2024A Call to Action for Generative AI in 2024
A Call to Action for Generative AI in 2024Results
 
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfThe Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfEnterprise Knowledge
 
EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptx
EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptxEIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptx
EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptxEarley Information Science
 
CNv6 Instructor Chapter 6 Quality of Service
CNv6 Instructor Chapter 6 Quality of ServiceCNv6 Instructor Chapter 6 Quality of Service
CNv6 Instructor Chapter 6 Quality of Servicegiselly40
 
IAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI SolutionsIAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI SolutionsEnterprise Knowledge
 
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...Neo4j
 
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking MenDelhi Call girls
 
Finology Group – Insurtech Innovation Award 2024
Finology Group – Insurtech Innovation Award 2024Finology Group – Insurtech Innovation Award 2024
Finology Group – Insurtech Innovation Award 2024The Digital Insurer
 
Data Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt RobisonData Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt RobisonAnna Loughnan Colquhoun
 
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationFrom Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationSafe Software
 

Dernier (20)

2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...
 
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...
 
How to convert PDF to text with Nanonets
How to convert PDF to text with NanonetsHow to convert PDF to text with Nanonets
How to convert PDF to text with Nanonets
 
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
 
Breaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path MountBreaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path Mount
 
A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)
 
Partners Life - Insurer Innovation Award 2024
Partners Life - Insurer Innovation Award 2024Partners Life - Insurer Innovation Award 2024
Partners Life - Insurer Innovation Award 2024
 
Handwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsHandwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed texts
 
Developing An App To Navigate The Roads of Brazil
Developing An App To Navigate The Roads of BrazilDeveloping An App To Navigate The Roads of Brazil
Developing An App To Navigate The Roads of Brazil
 
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
 
A Call to Action for Generative AI in 2024
A Call to Action for Generative AI in 2024A Call to Action for Generative AI in 2024
A Call to Action for Generative AI in 2024
 
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfThe Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
 
EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptx
EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptxEIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptx
EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptx
 
CNv6 Instructor Chapter 6 Quality of Service
CNv6 Instructor Chapter 6 Quality of ServiceCNv6 Instructor Chapter 6 Quality of Service
CNv6 Instructor Chapter 6 Quality of Service
 
IAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI SolutionsIAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI Solutions
 
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...
 
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
 
Finology Group – Insurtech Innovation Award 2024
Finology Group – Insurtech Innovation Award 2024Finology Group – Insurtech Innovation Award 2024
Finology Group – Insurtech Innovation Award 2024
 
Data Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt RobisonData Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt Robison
 
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationFrom Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
 

Chapter 4

  • 1. Chapter 4: Linear Programming Sensitivity Analysis © 2007 Pearson Education
  • 2. What if there is uncertainly about one or more values in the LP model? Sensitivity analysis allows us to determine how “sensitive” the optimal solution is to changes in data values. This includes analyzing changes in: 1. An Objective Function Coefficient (OFC) 2. A Right Hand Side (RHS) value of a constraint
  • 3. Graphical Sensitivity Analysis We can use the graph of an LP to see what happens when: 1. An OFC changes, or 2. A RHS changes Recall the Flair Furniture problem
  • 4. Flair Furniture Problem Max 7T + 5C (profit) Subject to the constraints: 3T + 4C < 2400 (carpentry hrs) 2T + 1C < 1000 (painting hrs) C < 450 T (max # chairs) > 100 (min # tables) T, C > 0 (nonnegativity)
  • 5. Objective Function Coefficient (OFC) Changes What if the profit contribution for tables changed from $7 to $8 per table? 8 Max X T + 5 C 7 (profit) Clearly profit goes up, but would we want to make more tables and less chairs? (i.e. Does the optimal solution change?)
  • 6. Characteristics of OFC Changes • There is no effect on the feasible region • The slope of the level profit line changes • If the slope changes enough, a different corner point will become optimal
  • 7. C Original Objective Function 7T + 5 C = $4040 Revised Objective Function 8T + 5 C = $4360 Optimal Corner (T=320, C=360) Still optimal 500 400 300 200 Feasible Region 100 0 0 100 200 300 400 500 T
  • 8. What if the OFC became higher? Or lower? 11T + 5C = $5500 Optimal Solution (T=500, C=0) C 1000 Both have new optimal corner points 600 450 3T + 5C = $2850 Optimal Solution (T=200, C=450) Feasible Region 0 0 100 500 800 T
  • 9. • There is a range for each OFC where the current optimal corner point remains optimal. • If the OFC changes beyond that range a new corner point becomes optimal. • Excel’s Solver will calculate the OFC range.
  • 10. Right Hand Side (RHS) Changes What if painting hours available changed from 1000 to 1300? X 2T + 1C < 1000 1300 (painting hrs) This increase in resources could allow us to increase production and profit.
  • 11. Characteristics of RHS Changes • The constraint line shifts, which could change the feasible region • Slope of constraint line does not change • Corner point locations can change • The optimal solution can change
  • 12. Old optimal corner point (T=320,C=360) Profit=$4040 C 500 Feasible region becomes larger 400 New optimal corner point (T=560,C=180) Profit=$4820 300 100 200 300 400 500 300 =1 0 00 Region 0 1C =1 Feasible 0 + 2T 100 1C Original + 2T 200 600 T
  • 13. Effect on Objective Function Value New profit Old profit Profit increase = $4,820 = $4,040 = $780 from 300 additional painting hours $2.60 in profit per hour of painting • Each additional hour will increase profit by $2.60 • Each hour lost will decrease profit by $2.60
  • 14. Shadow Price The change is the objective function value per one-unit increase in the RHS of the constraint. Will painting hours be worth $2.60 per hour regardless of many hours are available ?
  • 15. Range of Shadow Price Validity Beyond some RHS range the value of each painting hour will change. While the RHS stays within this range, the shadow price does not change. Excel will calculate this range as well as the shadow price.
  • 16. Solver’s Sensitivity Report When Excel Solver is used to find an optimal solution, the option of generating the “Sensitivity Report” is available. Go to file 4-1.xls
  • 17. 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) If the RHS change goes beyond the allowable range, then the shadow price will change.
  • 18. Objective Function Coefficient (OFC) Changes If the change in OFC is within the allowable range, then: • The optimal solution does not change • The new objective function value can be calculated
  • 19. Anderson Electronics Example Decision: How many of each of 4 products to make? Objective: Maximize profit Decision Variables: V = number of VCR’s S = number of stereos T = number of TV’s D = number of DVD players
  • 20. Max 29V + 32S + 72T + 54D (in $ of profit) Subject to the constraints: 3V + 4S + 4T + 3D < 4700 2V + 2S + 4T + 3D < 4500 V + S + 3T + 2D < 2500 V, S, T, D > 0 Go to file 4-2.xls (elec. components) (nonelec. components) (assembly hours) (nonnegativity)
  • 21. RHS Change Questions • What if the supply of nonelectrical components changes? • What happens if the supply of electrical components – increased by 400 (to 5100)? – increased by 4000 (to 8700)?
  • 22. • What if we could buy an additional 400 elec. components for $1 more than usual? Would we want to buy them? • What if would could get an additional 250 hours of assembly time by paying $5 per hour more than usual? Would this be profitable?
  • 23. Decision Variables That Equal 0 We are not currently making any VCR’s (V=0) because they are not profitable enough. How much would profit need to increase before we would want to begin making VCR’s?
  • 24. Reduced Cost of a Decision Variable (marginal contribution to the obj. func. value) - (marginal value of resources used) = Reduced Cost marginal profit of a VCR = $29 - marginal value of resources = ? Reduced Cost of a VCR = - $1.0
  • 25. Reduced Cost is: • The minimum amount by which the OFC of a variable should change to cause that variable to become non-zero. • The amount by which the objective function value would change if the variable were forced to change from 0 to 1.
  • 26. OFC Change Questions • For what range of profit contributions for DVD players will the current solution remain optimal? • What happens to profit if this value drops to $50 per DVD player?
  • 27. Alternate Optimal Solutions May be present when there are 0’s in the Allowable Increase or Allowable Decrease values for OFC values.
  • 28. Simultaneous Changes All changes discussed up to this point have involved only 1 change at a time. What if several OFC’s change? Or What if several RHS’s change? Note: they cannot be mixed
  • 29. The 100% Rule ∑ (change / allowable change) < 1 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
  • 30. Pricing New Variables Suppose they are considering selling a new product, Home Theater Systems (HTS) Need to determine whether making HTS’s would be sufficiently profitable Producing HTS’s would take limited resources away from other products
  • 31. • To produce one HTS requires: 5 electrical components 4 nonelectrical components 4 hours of assembly time • Can shadow prices be used to calculate reduction in profit from other products? (check 100% rule) 5/950 + 4/560 + 4/1325 = 0.015 < 1
  • 32. Required Profit Contribution per HTS elec cpnts 5 x $ 2 = $10 nonelec cpnts 4 x $ 0 = $ 0 assembly hrs 4 x $24 = $96 $106 Shadow Prices Making 1 HTS will reduce profit (from other products) by $106
  • 33. • Need (HTS profit contribution) > $106 • Cost to produce each HTS: elec cpnts 5 x $ 7 = $35 nonelec cpnts 4 x $ 5 = $20 assembly hrs4 x $10 = $40 $95 (HTS profit contribution) = (selling price) - $95 So selling price must be at least $201
  • 34. Is HTS Sufficiently Profitable? • Marketing estimates that selling price should not exceed $175 • Producing one HTS will cause profit to fall by $26 ($201 - $175) Go to file 4-3.xls
  • 35. Sensitivity Analysis for a Minimization Problem Burn-Off makes a “miracle” diet drink Decision: How much of each of 4 ingredients to use? Objective: Minimize cost of ingredients
  • 36. Data Units of Chemical per Ounce of Ingredient Ingredient X A 3 B 4 C 8 D 10 > 280 units Y 5 3 6 6 > 200 units Z 10 25 20 40 < 1050 units Chemical $ per ounce of ingredient $0.40 $0.20 $0.60 $0.30 Requirement
  • 37. Min 0.40A + 0.20B + 0.60C + 0.30D ($ of cost) Subject to the constraints A+B+C+D > 36 (min daily ounces) 3A + 4B + 8C + 10D > 280 (chem x min) 5A + 3B + 6C + 6D > 200 (chem y min) 10A + 25B + 20C + 40D < 280 (chem z max) A, B, C, > 0 Go to file 4-5.xls