What is sensitivity analysis? Why do we perform sensitivity analysis? How far do we like to perform sensitivity analysis? In an LP sensitivity analysis,

Slides:



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

IEOR 4004 Midterm review (Part II) March 12, 2014.
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.
Linear Programming – Sensitivity Analysis How much can the objective function coefficients change before the values of the variables change? How much can.
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.
Linear Programming Sensitivity of the Right Hand Side Coefficients.
1/53 Slide Linear Programming: Sensitivity Analysis and Interpretation of Solution n Introduction to Sensitivity Analysis n Graphical Sensitivity Analysis.
SENSITIVITY ANALYSIS.
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
LP EXAMPLES.
Chapter 7 Linear Programming Models Part One n Basis of Linear Programming n Linear Program formulati on.
Chapter 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
Step 1: Formulate the Problem Decision Variables Objective Function (O. F.) Constraints (S. T.) Sign Constraints (URS) Step 2: Create the Standard Form.
1 Chapter 6 Sensitivity Analysis and Duality PART 3 Mahmut Ali GÖKÇE.
ISM 206 Lecture 4 Duality and Sensitivity Analysis.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
QM B Lego Simplex. Scenario You manufacture tables and chairs. Tables and chairs are manufactured from small and large bricks. Small brick Large brick.
Spreadsheet Modeling & Decision Analysis:
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.
Computational Methods for Management and Economics Carla Gomes
Introduction to Mathematical Programming OR/MA 504 Chapter 3.
The application of mathematics and the scientific
Robert Delgado Chris Mui Amanda Smith Presented to: Dr. Sima Parisay Due: October 20 th, 2011 California State Polytechnic University, Pomona.
Special Conditions in LP Models (sambungan BAB 1)
Presentation: H. Sarper
Managerial Decision Making and Problem Solving
Chapter 6 Sensitivity Analysis & Duality
The Simplex Method Updated 15 February Main Steps of the Simplex Method 1.Put the problem in Row-Zero Form. 2.Construct the Simplex tableau. 3.Obtain.
MIT and James Orlin © Chapter 5. Sensitivity Analysis presented as FAQs –Points illustrated on a running example of glass manufacturing. –Also the.
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Parametric Linear Programming-1 Parametric Linear Programming.
Linear Programming – Simplex Method
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.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
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 Simplex Method for Bounded Variables Linear programming problems with lower and upper bounds Generalizing simplex algorithm for bounded variables Reference:
Sensitivity analysis LI Xiao-lei. A graphical introduction to sensitivity analysis Sensitivity analysis is concerned with how changes in an LP’s parameters.
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.
1 Chapter 4 The Simplex Algorithm PART 2 Prof. Dr. M. Arslan ÖRNEK.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
LP Examples Solid Waste Management. A SOLID WASTE PROBLEM Landfill Maximum capacity (tons/day) Cost of transfer to landfill ($/ton) Cost of disposal at.
Sensitivity Analysis Introduction to Sensitivity Analysis
SENSITIVITY ANALYSIS. 2 Sensitivity Analysis Sensitivity analysis is carried out after optimal solution is found. Hence called as post optimality analysis.
Chap 10. Sensitivity Analysis
St. Edward’s University
Chapter 5 Sensitivity Analysis: An Applied Approach
What is sensitivity analysis? Why do we perform sensitivity analysis?
The application of mathematics and the scientific
Duality Theory and Sensitivity Analysis
Sensitivity Analysis and
Sensitivity.
Lecture 4 Part I Mohamed A. M. A..
Section 3.4 Sensitivity Analysis.
Linear Programming – Sensitivity Analysis
Step 1: Formulate the Problem Decision Variables
Goal Programming: Example 1 on Page 191 Show HIM LIP HIW Cost/min
Simplex Transportation (skip)
Goal Programming: Example 1 on Page 191 Show HIM LIP HIW Cost/min
Presentation transcript:

What is sensitivity analysis? Why do we perform sensitivity analysis? How far do we like to perform sensitivity analysis? In an LP sensitivity analysis, what type of conditions or information are considered? In an LP sensitivity analysis, what type of conclusions are considered? IE 416, Chap 5:1, July 98

Shadow Price: SP page 199 Shadow price for the i th constraint of an LP is the amount by which the optimal z-value is improved if the rhs of the i th constraint is increased by 1. Reduced Cost: RC page 205 For any nonbasic variable X k, the reduced cost is the amount by which the objective function coefficient of X k must be improved before the LP will have an optimal solution in which X k is a basic variable IE 416, Chap 4:3, July 98

Terms Used in Different Books on Simplex method WinstonWinQSB System BindingTight Non-bindingLooseSlack ExcessSurplus Reduced costOpportunity cost Shadow priceDual price IE 416, Chap 4:4, July 98

Summary of LP Sensitivity Analysis, Notations O.F. Z=C BV *X BV + C NBV *X NBV S.T. a b1 *X 1 + a b2 *X 2 + … =< b b a n1 *X 1 + a n2 *X 2 + …. =<b n Where: C BV = coefficient of basic variable in Z C NBV = ….. nonbasic variable in Z X BV = basic variable in optimal solution X NBV = nonbasic variable in optimal solution b b = right hand side of binding constraint b n = right hand side of nonbinding constraint SP i = shadow price of constraint i RC i = reduced cost of X NBV C’ BV = new C BV, C’ NBV = new C NBV, b’ b = new b b, b’ n = new b n IE 416, Chap 5, Feb. 98

Summary of LP Sensitivity Analysis Summary information from output of the Quant software: Coefficient of OF. RHS. Variable RC Min Current Max Constraint s i /e i SP Min Current Max Summary sensitivity analysis:. IF.. THEN. Basis (var) bfs (value) Z (value). min C’ BV max same same Z+( C BV )X BV C’ Bv out of range change change change min C’ NBV max same same same C’ NBv out of range X NBV ->X’ BV change change min b’ b max same change Z+SP b ( b b ) b’ b out of range change change change min b’ n max same same same b’ n out of range change change change Note: y = y’ - y Note: If output of the Lindo is being used then Z SP b ( b b ); Use + if O.F. is max; Use - if O.F. is min IE 416, Chap 5, Dec. 98

Managerial Use of Shadow Price What is the maximum amount that a manager would like to pay extra for an extra unit of a resource? Consider RMC problem and material 3 in the following table. IE 416, Chap 5, Sept. 2009