CHAPTER 8: POST OPTIMALITY ANALYSIS. What is Post Optimality Analysis?  Post Optimality Analysis –Sensitivity Analysis –What-If Analysis  what happens.

Slides:



Advertisements
Similar presentations
QingPeng (QP) Zhang  Sensitivity analysis is concerned with how changes in an linear programming’s parameters affect the optimal.
Advertisements

LINEAR PROGRAMMING SENSITIVITY ANALYSIS
Understanding optimum solution
Chapter 5 Sensitivity Analysis: An Applied Approach
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc. 1 Chapter 5 Sensitivity Analysis: An Applied Approach to accompany Introduction to.
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
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.
Operations Management Linear Programming Module B - Part 2
LP EXAMPLES.
Chapter 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
Sensitivity analysis BSAD 30 Dave Novak
Chapter 4: Linear Programming Sensitivity Analysis
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
1 Linear Programming Using the software that comes with the book.
1 Linear Programming With Sensitivity Analysis Here we look at some graphs to learn some ideas.
Sensitivity of the Objective Function Coefficients
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Seventh Edition © 2004 Prentice Hall, Inc. All rights reserved. Linear Programming.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
LINEAR PROGRAMMING: THE GRAPHICAL METHOD
Spreadsheet Modeling & Decision Analysis:
John Loucks Modifications by A. Asef-Vaziri Slides by St. Edward’s
Solver Linear Problem Solving MAN Micro-computers & Their Applications.
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
© Copyright 2004, Alan Marshall 1 Lecture 1 Linear Programming.
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.
Introduction to Mathematical Programming OR/MA 504 Chapter 3.
1 The Role of Sensitivity Analysis of the Optimal Solution Is the optimal solution sensitive to changes in input parameters? Possible reasons for asking.
Special Conditions in LP Models (sambungan BAB 1)
Readings Readings Chapter 3
Sensitivity Analysis What if there is uncertainly about one or more values in the LP model? 1. Raw material changes, 2. Product demand changes, 3. Stock.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
Managerial Decision Making and Problem Solving
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Table of Contents Chapter 5 (What-If Analysis for Linear Programming) Continuing the Wyndor.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
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.
Table of Contents Chapter 5 (What-If Analysis for Linear Programming) Continuing the Wyndor Case Study (Section 5.2)5.2 Changes in One Objective Function.
Table of Contents Chapter 6.8 (Sensitivity Analysis with Solver Table) Continuing the Wyndor Case Study Changes in One Objective Function Coefficient Simultaneous.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Chapter 6 Supplement Linear Programming.
Opener. Notes: 3.4 Linear Programming Optimization  Many real-life problems involve a process called optimization.  This means finding a maximum or.
5-1 Wyndor (Before What-If Analysis). 5-2 Using the Spreadsheet to do Sensitivity Analysis The profit per door has been revised from $300 to $200. No.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Linear Programming: Sensitivity Analysis and Interpretation of Solution Pertemuan 5 Matakuliah: K0442-Metode Kuantitatif Tahun: 2009.
LP: Summary thus far Requirements Graphical solutions Excel Sensitivity Analysis.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 9 Intro to 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.
What-If Analysis for Linear Programming
1 The Geometry of Linear Programs –the geometry of LPs illustrated on GTC Handouts: Lecture Notes February 5, 2002.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
Lecture 6 Linear Programming Sensitivity Analysis
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.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
Managerial Decision Modeling with Spreadsheets Chapter 4 Linear Programming Sensitivity Analysis.
SENSITIVITY ANALYSIS. 2 Sensitivity Analysis Sensitivity analysis is carried out after optimal solution is found. Hence called as post optimality analysis.
MIT and James Orlin © The Geometry of Linear Programs –the geometry of LPs illustrated on GTC.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Practice: Given the following Sensitivity Analysis Report
St. Edward’s University
CHAPTER 6:LINEAR PROGRAMMING
Limiting factor analysis
Graphical Sensitivity Analysis and Computer Solution
Sensitivity.
Section 3.4 Sensitivity Analysis.
Presentation transcript:

CHAPTER 8: POST OPTIMALITY ANALYSIS

What is Post Optimality Analysis?  Post Optimality Analysis –Sensitivity Analysis –What-If Analysis  what happens to the optimal solution if: –THE INPUTS CHANGE: –THE CONDITIONS OF THE BUSINESS OBJECTIVE CHANGE –THE FACTORY PARAMETERS CHANGE

 Example –Let X = the number of Tables made per week, Let Y = the number of Chairs made per week, –Maximise Profit = 4X + 3Y Objective Function Subject to 4X+1Y  90 Wood 2X+1Y  50 Machine-Time 1X +1Y  40 Polishing-Time X, Y  0

Shadow Costs, Binding & Non-Binding Constraints  Wood constraint –4X + 1Y  90 –Optimal Solution(X,Y)=(10,30), –the wood used 4*10+1*30=70 kilograms –20 kilograms unused---slack value –Let RHS 90  90+1 or 90-1 –The optimal solution does not change. –The addition or removal of one kilogram of Wood makes no difference to the optimal production plan. The Wood constraint is said to be a Non-Binding constraint.

 Definition of a Non-Binding Constraint –If the availability of an additional unit of a resource has no effect on the production plan, then that constraint is said to be non-binding.  Definition Shadow Cost –The Shadow Cost of a resource is the additional profit generated by an additional unit of that resource. –Example: WOOD is a Non-Binding Constraint and definitionally non-binding constraints have a Shadow Cost = 0

 Machine-Time constraint –2X + 1Y  50 –Let RHS 50  51 or 49 –The optimal solution change. –(X,Y) =(10,30)  (X,Y)=(11,29) –Change=(1,-1)

 Definition Binding Constraint –If the availability of an additional unit of resource alters the optimal production plan, thereby increasing the profit, then that constraint is said to be a 'Binding Constraint'.  Shadow Cost of Machine-Time – The new value of the objective function :4*11+3*29=131 –The shadow cost of the resource Machine-Time: £ 1  Shadow Cost: A way of pricing the value of the resource

 The consequences of linear systems –if increasing 2 hours or decreasing 5 hours of Machine-Time became available, the new production plan would be: (10, 30) +2*(1,-1) = (10, 30) + (2, -2) = (12, 28) (10, 30) +(-5)*(1,-1) = (10, 30) + (-5, 5) = (5, 35) –The new profit would be : Old profit + 2*Shadow Cost £ *£1 = £132 Old profit + (-5)*Shadow Cost £130 + (-5)*£1 = £125

 Polishing-Time constraint –Polishing-Time is a binding constraint –The shadow price for Polishing-Time is £2  Summary RESOURCEBINDING/NON BINDING SLACKSHADOW COST WOODNON-BINDING20Kgms of WOOD£0 MACHINE TIMEBINDING0 Hours£1 POLISHING TIMEBINDING0 Hours£2

Resource Ranging  How much is it possible to increase or decrease the units of a resource whilst the shadow price is effective?

 Ranging for the WOOD resource Lower Limit: 70 –Existing Resource: 90 Upper Limit No upper: limit.

 Ranging for the MACHINE-TIME resource  Lower Limit 40 Existing Resource 50 Upper Limit 56.67

 The ranging for the resource POLISHING- TIME Lower Limit 30 Existing Resource 40 Upper Limit 50  Summary RESOURCELOWER LIMITEXISTING RESOURCE UPPER LIMIT WOOD7090No upper limit. MACHINE-TIME POLISHING-TIME304050

Changes in the Objective Function Coefficient  Introductory details –Profit = aX + bY –Y=Profit/b-a/b X Example: Profit = 4X + 3Y Y = Profit/3 -4/3 X –The slope of the Machine-Time constraint Y = X –The slope of Polishing-Time constraint Y=40-1X –The slope of objective function must lie between the two constraint slopes

Y = 40-1X Y = Profit/b -a/b X (Y=130/3-a/3 X) Y = X

–The coefficient of Y can vary : 2 to 4 Slopes Machine-TimeObjectivePolishing-Time -2-a/3 –The coefficient of X can vary : 3 to 6 Slopes Machine-TimeObjectivePolishing-Time -2-4/b

The Factory Parameter Changes  If the factory were to invest in different plant, new technology that had the effect of making more effective use of the input resources, how would this modify the solution to the linear programming?  The practical way to see the effect this has on the linear programming is to resolve the linear programming with the new constraint