What is sensitivity analysis? Why do we perform 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.
Solving LP Models Improving Search Special Form of Improving Search
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.
What is sensitivity analysis? Why do we perform sensitivity analysis? How far do we like to perform sensitivity analysis? In an LP sensitivity analysis,
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 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Linear Programming.
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
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.
Presentation: H. Sarper
Chapter 6 Sensitivity Analysis & Duality
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.
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.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
Sensitivity Analysis Introduction to Sensitivity Analysis
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
Solving Linear Program by Simplex Method The Concept
Chap 10. Sensitivity Analysis
St. Edward’s University
BIA 674 – Supply Chain Analytics
Operation Research (OR) RG753 Sensitivity Analysis October 15, 22, 29
Chapter 5 Sensitivity Analysis: An Applied Approach
The Two-Phase Simplex Method
MAN 305 OPERATIONS RESEARCH II Week 4 –Sensitivity Analysis with Spreadsheets DR. KAZIM BARIŞ ATICI.
Chapter 5 Simplex-Based Sensitivity Analysis and Duality
Chap 9. General LP problems: Duality and Infeasibility
Chapter 5. Sensitivity Analysis
ENGM 631 Optimization Ch. 4: Solving Linear Programs: The Simplex Method.
The application of mathematics and the scientific
Duality Theory and Sensitivity Analysis
Sensitivity Analysis and
St. Edward’s University
Sensitivity.
LP Example of Soil Stability
Lecture 4 Part I Mohamed A. M. A..
Section 3.4 Sensitivity Analysis.
Linear Programming – Sensitivity Analysis
Step 1: Formulate the Problem Decision Variables
Chapter-III Duality in LPP
Simplex method (algebraic interpretation)
Goal Programming: Example 1 on Page 191 Show HIM LIP HIW Cost/min
BASIC FEASIBLE SOLUTIONS
Simplex Transportation (skip)
Goal Programming: Example 1 on Page 191 Show HIM LIP HIW Cost/min
Prepared by Po-Chuan on 2016/05/24
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 230 Reduced Cost: RC page 236 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 236 For any nonbasic variable Xk, the reduced cost is the amount by which the objective function coefficient of Xk must be improved before the LP will have an optimal solution in which Xk is a basic variable IE 416, Chap 4:3, July 98

Terms Used in Different Books on Simplex method Winston WinQSB System Binding Tight Non-binding Loose Slack Slack Excess Surplus Reduced cost Opportunity cost Shadow price Dual price IE 416, Chap 4:4, July 98

Summary of LP Sensitivity Analysis, Notations O.F. Z=CBV*XBV + CNBV*XNBV S.T. ab1*X1 + ab2*X2 + … =< bb an1*X1 + an2*X2 + …. =<bn Where: CBV = coefficient of basic variable in Z CNBV = ….. nonbasic variable in Z XBV = basic variable in optimal solution XNBV = nonbasic variable in optimal solution bb = right hand side of binding constraint bn = right hand side of nonbinding constraint SPi = shadow price of constraint i RCi = reduced cost of XNBV C’BV = new CBV , C’NBV = new CNBV , b’b= new bb , b’n= new bn 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 si/ei SP Min Current Max Summary sensitivity analysis: . IF . . THEN . Basis (var) bfs (value) Z (value) . min C’BV max same same Z+( CBV)XBV C’Bv out of range change change change min C’NBV max same same same C’NBv out of range XNBV ->X’BV change change min b’b max same change Z+SPb( bb) 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 SPb( bb); Use + if O.F. is max; Use - if O.F. is min IE 416, Chap 5, Dec. 98