SENSITIVITY ANALYSIS. 2 Sensitivity Analysis Sensitivity analysis is carried out after optimal solution is found. Hence called as post optimality analysis.

Slides:



Advertisements
Similar presentations
Chapter 5: Linear Programming: The Simplex Method
Advertisements

EMGT 501 HW #1 Solutions Chapter 2 - SELF TEST 18
Chapter 5 Sensitivity Analysis: An Applied Approach
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
SIMPLEX METHOD FOR LP LP Model.
LECTURE 14 Minimization Two Phase method by Dr. Arshad zaheer
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
What is sensitivity analysis? Why do we perform sensitivity analysis? How far do we like to perform sensitivity analysis? In an LP sensitivity analysis,
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
Chapter 7 Linear Programming Models Part One n Basis of Linear Programming n Linear Program formulati on.
Linear Programming: Fundamentals
ISM 206 Lecture 4 Duality and Sensitivity Analysis.
LINEAR PROGRAMMING: THE GRAPHICAL METHOD
LINEAR PROGRAMMING SIMPLEX METHOD.
Chapter 3 Linear Programming Methods 高等作業研究 高等作業研究 ( 一 ) Chapter 3 Linear Programming Methods (II)
1 Chapter 8 Sensitivity Analysis  Bottom line:   How does the optimal solution change as some of the elements of the model change?  For obvious reasons.
Presentation: H. Sarper
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
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,
Chapter 6 Sensitivity Analysis & Duality
Duality Theory LI Xiaolei.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming: The Simplex Method Chapter 5.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
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.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
Chapter 6 Supplement Linear Programming.
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Mar 4, 2011.
A model consisting of linear relationships representing a firm’s objective and resource constraints Linear Programming (LP) LP is a mathematical modeling.
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.
Duality Theory.
Chapter 6 Simplex-Based Sensitivity Analysis and Duality
Linear Programming Revised Simplex Method, Duality of LP problems and Sensitivity analysis D Nagesh Kumar, IISc Optimization Methods: M3L5.
Advanced Operations Research Models Instructor: Dr. A. Seifi Teaching Assistant: Golbarg Kazemi 1.
 Minimization Problem  First Approach  Introduce the basis variable  To solve minimization problem we simple reverse the rule that is we select the.
1 1 Slide © 2005 Thomson/South-Western Linear Programming: The Simplex Method n An Overview of the Simplex Method n Standard Form n Tableau Form n Setting.
Chapter 4 Linear Programming: The Simplex Method
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.
Part 3 Linear Programming 3.3 Theoretical Analysis.
OR Chapter 8. General LP Problems Converting other forms to general LP problem : min c’x  - max (-c)’x   = by adding a nonnegative slack variable.
OR Chapter 7. The Revised Simplex Method  Recall Theorem 3.1, same basis  same dictionary Entire dictionary can be constructed as long as we.
Simplex method : Tableau Form
1. 2 We studying these special cases to: 1- Present a theoretical explanation of these situations. 2- Provide a practical interpretation of what these.
Cutting-Plane Algorithm BY: Mustapha.D. Ibrahim. Introduction The cutting-plane algorithm starts at the continuous optimum LP solution Special constraints.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
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.
GOOD MORNING CLASS! In Operation Research Class, WE MEET AGAIN WITH A TOPIC OF :
Part 3 Linear Programming 3.3 Theoretical Analysis.
Solving Linear Program by Simplex Method The Concept
Linear Programming Revised Simplex Method, Duality of LP problems and Sensitivity analysis D Nagesh Kumar, IISc Optimization Methods: M3L5.
Chap 10. Sensitivity Analysis
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Chapter 5 Simplex-Based Sensitivity Analysis and Duality
Sindhuja K, Annapoorani G, Pramela Devi S Department: CSE
Chapter 4 Linear Programming: The Simplex Method
Chap 9. General LP problems: Duality and Infeasibility
Chapter 5. Sensitivity Analysis
Duality Theory and Sensitivity Analysis
Part 3 Linear Programming
St. Edward’s University
ENGM 631 Optimization.
Sensitivity.
Lecture 4 Part I Mohamed A. M. A..
Chapter-III Duality in LPP
DUALITY THEORY Reference: Chapter 6 in Bazaraa, Jarvis and Sherali.
Presentation transcript:

SENSITIVITY ANALYSIS

2 Sensitivity Analysis Sensitivity analysis is carried out after optimal solution is found. Hence called as post optimality analysis. Goal is to find out how changes in model coefficients affect the solution. Following can happen  The current solution remains unchanged.  The current solution becomes infeasible.  The current solution becomes non-optimal.  Current solution becomes infeasible and non-optimal.

SENSITIVITY ANALYSIS3 Solution Alternatives If the solution remains unchanged then we need not do any further calculations. If solution becomes infeasible then use dual simplex to restore feasibility. If solution becomes non-optimal then use primal simplex method to find new optimality. If the solution becomes both infeasible and non- optimal then we use both primal and dual simplex method to solve.

SENSITIVITY ANALYSIS4 What Changes can be made? Changes in objective coefficients  For non-basic variables  For basic variables Changes in availability of resources Changes in input/output coefficients Addition of new variables (column) Addition of new constraint (row)

SENSITIVITY ANALYSIS5 A little bit of Algebra Basicxjxj Starting X B Solution zc j - z j XBXB B –1 P j B -1 B –1 b LP form  Max z =  c j x j (j = 1 to n) subject to  P j x j = b  P j and b are column vectors

SENSITIVITY ANALYSIS6 Algebra continued.. The table on last page shows  Current basis matrix, starting X’s and Solution of BV. Let Y = (y1, y2… ym) be the m row vector for dual variables. The dual variables are calculated as  Y = C B B –1  where C B is the m row vector comprised of the original objective coefficients c j with the basis vector X B Thus c j – z j is computed as  c j – z j = c j -  a ij y i = c j – YP j Pj = aj (a matrix)  The above equation shows that cj – zj is the difference between the LHS and RHS of the dual constraints.

SENSITIVITY ANALYSIS7 Factors Affecting Feasibility The feasibility of a current solution can be changed if  the right side of constraints b is changed.  a new constraint is added. In both cases infeasibility occurs if one of the solution values (B –1 b) becomes negative, if one of the current basic variables becomes negative. Refer example.

SENSITIVITY ANALYSIS8 Adding New Constraint The addition of constraint can lead to two cases  The added constraint is redundant and hence solution remains same.  The new constraint is violated and hence we need to use dual simplex method for recovering feasibility. Refer excel sheet for example

SENSITIVITY ANALYSIS9 EXAMPLE A company wants to produce products A,B &C. the unit profit on these products are RS 4, Rs 6 & Rs. 2 respectively. The products require two resources namely manpower and raw material. Maximise Z = 4x1 + 6x2 + 2x3 Raw material constraint  x1 + 4x2 + 7x3 < 9 Manpower constraint  x1 + x2 + x3 < 3  x1, x2 & x3 > 0

SENSITIVITY ANALYSIS10 INITIAL SOLUTION

SENSITIVITY ANALYSIS11 CHANGE IN RHS OF THE CONSTRAINTS

SENSITIVITY ANALYSIS12 RANGE OF RHS CONSTRAINTS

SENSITIVITY ANALYSIS13 ADDING NEW CONSTRAINT

SENSITIVITY ANALYSIS14 ADDING NEW CONSTRAINT

SENSITIVITY ANALYSIS15 DUAL SIMPLEX

SENSITIVITY ANALYSIS16 Changes Affecting Optimality The current solution will cease to be optimal when cj – zj violate the optimality condition. This can change only when we change either the objective coefficients cj (C B ) or the unit resource usage vector Pj or aj. We know that  c j - z j = c j – Ya j where aj is unit resource usage vector.

SENSITIVITY ANALYSIS17 Changes in Objective Coefficients The effect of making changes in cj entails recomputing cj-zj for the NBV only. BV will remain zero (why?) Compute the dual prices (shadow) Y=C B B -1 using the new vector C B if it has changed Compute cj – zj = cj – Yaj for all current NBV. Following cases may arise  If the optimality condition is satisfied then current solution will remain.  If the optimality is changed we apply primal simplex to recover optimality.

SENSITIVITY ANALYSIS18 ADDITION OF NEW ACTIVITY This is akin to adding new variable in the objective function. Desirable only if the new economic activity is profitable. Check cj-zj = cj – YPj for the new activity where Y is current dual values, Pj (aj) is the resource for new variable and cj the contribution.

SENSITIVITY ANALYSIS19 Change of cj (NBV)

SENSITIVITY ANALYSIS20 Change of cj for Basic Variable