Graduate Program in Business Information Systems Linear Programming: Sensitivity Analysis and Duality Aslı Sencer.

Slides:



Advertisements
Similar presentations
Understanding optimum solution
Advertisements

Notes 4IE 3121 Why Sensitivity Analysis So far: find an optimium solution given certain constant parameters (costs, demand, etc) How well do we know these.
Sensitivity Analysis Sensitivity analysis examines how the optimal solution will be impacted by changes in the model coefficients due to uncertainty, error.
1/53 Slide Linear Programming: Sensitivity Analysis and Interpretation of Solution n Introduction to Sensitivity Analysis n Graphical Sensitivity Analysis.
SENSITIVITY ANALYSIS.
Optimization Models Module 9. MODEL OUTPUT EXTERNAL INPUTS DECISION INPUTS Optimization models answer the question, “What decision values give the best.
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
Operations Management Linear Programming Module B - Part 2
LP EXAMPLES.
Chapter 7 Linear Programming Models Part One n Basis of Linear Programming n Linear Program formulati on.
Introduction to Management Science
Chapter 4: Linear Programming Sensitivity Analysis
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
Linear Programming: Fundamentals
Linear Programming: Computer Solution and Sensitivity Analysis
3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.
LINEAR PROGRAMMING AND APPLICATIONS Graduate Program in Business Information Systems Aslı Sencer.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
John Loucks Modifications by A. Asef-Vaziri Slides by St. Edward’s
Solver Linear Problem Solving MAN Micro-computers & Their Applications.
© Copyright 2004, Alan Marshall 1 Lecture 1 Linear Programming.
Graduate Program in Business Information Systems Integer and Goal Programming Aslı Sencer.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Kerimcan OzcanMNGT 379 Operations Research1 LP: Sensitivity Analysis and Interpretation of Solution Chapter 3.
Computational Methods for Management and Economics Carla Gomes
Department of Business Administration
The Theory of the Simplex Method
Mathematical Programming Cht. 2, 3, 4, 5, 9, 10.
Chapter Topics Computer Solution Sensitivity Analysis
Managerial Decision Making and Problem Solving
We can make Product1 and Product2. There are 3 resources; Resource1, Resource2, Resource3. Product1 needs one hour of Resource1, nothing of Resource2,
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc. 1 Chapter 6 Sensitivity Analysis and Duality to accompany Introduction to Mathematical.
1 Chapter 10 The primal linear program solution answers the tactical question when it tells us how much to produce. But the dual can have far greater impact.
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Business Mathematics Rétallér Orsi.
CDAE Class 12 Oct. 5 Last class: Quiz 3 3. Linear programming and applications Today: Result of Quiz 3 3. Linear programming and applications Next.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
1/24: Linear Programming & Sensitivity Analysis Review: –LP Requirements –Graphical solutions Using MS Excel for Linear Programming Sensitivity Analysis.
CDAE Class 17 Oct. 23 Last class: Result of Quiz 4 3. Linear programming and applications Today: 3. Linear programming and applications Review for.
3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.
LP: Summary thus far Requirements Graphical solutions Excel Sensitivity Analysis.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
Professional software packages such as The WinQSB and LINDO provide the following LP information: Information about the objective function: –its optimal.
Chapter 6 Simplex-Based Sensitivity Analysis and Duality
1 1 Slide © 2005 Thomson/South-Western Simplex-Based Sensitivity Analysis and Duality n Sensitivity Analysis with the Simplex Tableau n Duality.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Sensitivity analysis continued… BSAD 30 Dave Novak Source: Anderson et al., 2013 Quantitative Methods for Business 12 th edition – some slides are directly.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
CDAE Class 15 Oct. 16 Last class: Result of group project 1 3. Linear programming and applications Class Exercise 7 Today: 3. Linear programming.
CDAE Class 16 Oct. 18 Last class: 3. Linear programming and applications Quiz 4 Today: Result of Quiz 4 3. Linear programming and applications Group.
Don Sutton Spring LP Basic Properties Objective Function – maximize/minimize profit/cost Resource Constraints – labor, money Decision.
P RIMAL -D UAL LPP. T HE R EDDY M IKKS C OMPANY - PROBLEM Reddy Mikks company produces both interior and exterior paints from two raw materials, M 1 and.
Practice: Given the following Sensitivity Analysis Report
Chapter 3: Sensitivity Analysis and the Dual Problem & Shadow Prices
Linear Programming: Sensitivity Analysis and Duality
St. Edward’s University
EMGT 6412/MATH 6665 Mathematical Programming Spring 2016
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
MBA 651 Quantitative Methods for Decision Making
MAN 305 OPERATIONS RESEARCH II Week 4 –Sensitivity Analysis with Spreadsheets DR. KAZIM BARIŞ ATICI.
Chapter 5 Simplex-Based Sensitivity Analysis and Duality
Duality Theory and Sensitivity Analysis
Linear Programming SIMPLEX METHOD.
Sensitivity.
Optimization Models Module 9.
Applied Statistical and Optimization Models
Presentation transcript:

Graduate Program in Business Information Systems Linear Programming: Sensitivity Analysis and Duality Aslı Sencer

BIS 517- Aslı Sencer2 Shadow Prices and Opportunity Costs  LP solution answers the tactical question, i.e., how much to produce  Suppose the focus is on resources rather than the products, i.e., Each resource has a shadow price that reflects the true impact of scarcity. To find these, we need a transformation of the primal problem which is referred to as the dual problem.

BIS 517- Aslı Sencer 3 Ex:Redwood Furniture Product Mix problem (revisited) : number of tables produced in a period : number of chairs produced in a period Optimal Solution: Xt=4 tables, Xc=9 Chairs Profit*=$96 Optimal Solution: Xt=4, Xc=9 Profit*=$96 Resource used Resource Available Resource Left Wood300 0 Labor110 0

BIS 517- Aslı Sencer4 Increasing the Available Resources  What happens if the available wood is increased by 1 ft?  Need to resolve LP with the new constraint  which yields X T *=4.05, X C *=8.975, P*=$96.10

BIS 517- Aslı Sencer5 Graphical Representation Constraint 1 Constraint (4,9) XtXt XcXc NEW OPTIMAL SOLUTION X t =4.05, X c =8.975 P=$96.10

BIS 517- Aslı Sencer6 Shadow Price and Opportunity Cost Optimal profit in the new problem is $96.10-$96=$0.1 greater! SHADOW PRICE Shadow price is the marginal value of a resource. Shadow price is the opportunity cost of not increasing the resource.

BIS 517- Aslı Sencer7 Question? Question 1: How much should the DM be willing to pay for a unit increase in wood resource? Answer: Infact, the DM should not pay more than $0.1 for a unit increase in the current wood capacity of $300

BIS 517- Aslı Sencer8 Question?  Question 2: If the wood resource is to be increased by 100ft (i.e., it will be 400 ft now), what will be the new optimal profit?  Answer: Can not tell directly! Shadow prices are valid only for certain ranges of change in the available resources.

BIS 517- Aslı Sencer9 Question?  Why do you think it is so? Constraint 1 Constraint (4,9) XtXt XcXc NEW OPTIMUM

BIS 517- Aslı Sencer10 The Dual Problem: Technical Approach PRIMAL PROBLEM DUAL PROBLEM For any primal solution X t, X c (not necessarily optimal), there is a corresponding dual solution U w, U L. If the primal solution is not optimal, then dual solution is infeasible! If they are both feasible then both solutions are optimal and P*=C*!

BIS 517- Aslı Sencer11 Dual Problem: Economical Interpretation  Primal problem: Production Manager’s perspective: Optimize resource allocation to maximize Total Profit.  Dual problem:Economist’s perspective: Optimize resource allocation to minimize aggregate value of increasing any resource by one more unit.

BIS 517- Aslı Sencer12 Dual formulation If for any product Marginal opportunity cost > Marginal return Do not produce Marginal opportunity cost < Marginal return Produce more Marginal opportunity cost = Marginal return Current production level is optimal

BIS 517- Aslı Sencer13 Sensitivity Analysis Using Excel Solver Adjustable Cells CellName Final Value Reduced Cost Objective Coefficient Allowable Increase Allowable Decrease $C$9Xt40662 $D$9Xc90844 Constraints CellName Final Value Shadow Price Current R.H. Side Allowable Increase Allowable Decrease $G$5<= LHS3000, $G$6<= LHS1100,

BIS 517- Aslı Sencer14 Questions?  If available wood is 310ft, what is the new optimal solution? =10ft increase is required From the sensitivity analysis allowable increase is 360, so shadow prices are valid! Pnew*=96+10*0.1=$97. The optimal solution is found by solving  If the available wood is 700ft what is the new optimal solution? 700> =660, so a new solution will exist. We need to resolve it with new constraint!

BIS 517- Aslı Sencer15 Questions?  If the unit profit of a table is decreased to $5, new optimum? Current value is 6, thus $1 decrease is required. In the sensitivity table, allowable decrease is 2. So current solution is still optimal. Xt=4, Xc=9 and P=5(4)+8(9)=$92  Would you hire an extra labor for 10 hrs at a total cost of $5? In the sensitivity table, allowable increase is 40, so dual prices are valid. increase in optimal profit=0.6(10)=$6. Net saving=$6-$5=$1>0, so hire labor!

BIS 517- Aslı Sencer16 Questions?  How is the optimal solution found in this case? The optimal solution is found by solving

BIS 517- Aslı Sencer17 Pricing new products using shadow prices desk  Making a desk would divert resources from tables and chairs, and fewer would be made.  Redwood evaluates new products:  Bench having profit of $7, needing 25 board feet of wood and 7 hours of labor.  Planter box having profit of $2, needing 10 board feet of wood and 2 hours of labor.  The opportunity costs for one of each are:  Bench: $.10(25) +.60(7) = $6.70 (< $7). Make it, because doing so increases P by $.30/unit.  Planter box: $.10(10) +.60(2) = $2.40 (> $2). Do not make. Resources are too valuable.