Professional software packages such as The WinQSB and LINDO provide the following LP information: Information about the objective function: –its optimal.

Slides:



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

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
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.
Linear Programming Sensitivity of the Right Hand Side Coefficients.
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.
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
SENSITIVITY ANALYSIS.
Linear and Integer Programming Models
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.
Sensitivity analysis BSAD 30 Dave Novak
Exam Feb 28: sets 1,2 Set 2 due Thurs. LP SENSITIVITY Ch 3.
Sensitivity of the Objective Function Coefficients
Linear Programming OPIM 310-Lecture 2 Instructor: Jose Cruz.
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.
LINEAR PROGRAMMING: THE GRAPHICAL METHOD
John Loucks Modifications by A. Asef-Vaziri Slides by St. Edward’s
Linear Programming.
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.
Computational Methods for Management and Economics Carla Gomes
Linear Programming Sensitivity of the Objective Function Coefficients.
1 The Role of Sensitivity Analysis of the Optimal Solution Is the optimal solution sensitive to changes in input parameters? Possible reasons for asking.
Linear Programming Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
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.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
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.
Linear and Integer Programming Models 1 Chapter 2.
Managerial Decision Making and Problem Solving
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Chapter 6 Supplement Linear Programming.
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.
Sensitivity Analysis Consider the CrossChek hockey stick production problem:   Management believes that CrossChek might only receive $120 profit from the.
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.
Chapter 6 Simplex-Based Sensitivity Analysis and Duality
Sensitivity Analysis Consider the CrossChek hockey stick production problem: Management believes that CrossChek might only receive $120 profit from the.
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.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
Sensitivity Analysis Introduction to Sensitivity Analysis
LP SENSITIVITY. Graphical Sensitivity Analysis A.Objective Function B.Left-hand side of constraint C.Right-hand side of constraint.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
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.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
St. Edward’s University
Chapter 5 Sensitivity Analysis: An Applied Approach
MAN 305 OPERATIONS RESEARCH II Week 4 –Sensitivity Analysis with Spreadsheets DR. KAZIM BARIŞ ATICI.
Graphical Analysis – the Feasible Region
Sensitivity Analysis and
Section 3.4 Sensitivity Analysis.
Linear Programming – Sensitivity Analysis
Presentation transcript:

Professional software packages such as The WinQSB and LINDO provide the following LP information: Information about the objective function: –its optimal value –coefficient ranges (ranges of optimality) Information about the decision variables: –their optimal values –their reduced costs Information about the constraints: –the amount of slack or surplus –the dual prices –right-hand side ranges (ranges of validity of shadow prices) In this presentation we will discuss: –changes in the coefficients of the objective function –changes in the right-hand side value of a constraint

Sensitivity analysis (or post-optimality analysis) is used to determine how the optimal solution is affected by changes, within specified ranges, in: –the objective function coefficients –the right-hand side (RHS) values Sensitivity analysis is important to the manager who must operate in a dynamic environment with imprecise estimates of the coefficients. Sensitivity analysis allows him to ask certain what-if questions about the problem.

Consider the following LP problem: Max 5x1 + 7x2 s.t. x1 < 6 2x1 + 3x2 < 19 2x1 + 3x2 < 19 x1 + x2 < 8 x1 + x2 < 8 x1, x2 > 0 x1, x2 > 0

Graphical Solution x 2 x 2 x1x1x1x1 x 1 + x 2 < 8 Max 5 x 1 + 7x 2 x 1 < 6 Optimal: x 1 = 5, x 2 = 3, z = 46

Let us consider how a change in the right-hand side for a constraint might affect the feasible region and perhaps cause a change in the optimal solution. The improvement in the value of the optimal solution per unit increase in the right-hand side is called the dual price. The range of feasibility is the range over which the dual price is applicable. As the RHS increases, other constraints will become binding and limit the change in the value of the objective function.

The range of RHS for a change in the right hand side value is the range of values for this coefficient in which the original dual price remains constant. Graphically, the range of feasibility is determined by finding the values of a right hand side coefficient such that the same two lines that determined the original optimal solution continue to determine the optimal solution for the problem.

Another Example: Max 10x1 + 15x2 (Total Weekly Profit) s.t. 2x1 + 4x2 < 100 (Aluminum Available) 3x1 + 2x2 < 80 (Steel Available) 3x1 + 2x2 < 80 (Steel Available) x1, x2 > 0 x1, x2 > 0

Optimal Solution According to the WinQSB output: x1 (Deluxe frames) = 15 x1 (Deluxe frames) = 15 x2 (Professional frames) = 17.5 x2 (Professional frames) = 17.5 Objective function value = $412.50

Question Suppose the profit on deluxe frames is increased to $20. Is the above solution still optimal? What is the value of the objective function when this unit profit is increased to $20?

Answer The output states that the solution remains optimal as long as the objective function coefficient of x1 is between 7.5 and Since 20 is within this range, the optimal solution will not change. The optimal profit will change: 20x1 + 15x2 = 20(15) + 15(17.5) = $

Question If aluminum were a relevant cost, what is the maximum amount the company should pay for 50 extra pounds of aluminum? Answer Since the cost for aluminum is a sunk cost, the shadow price provides the value of extra aluminum. The shadow price for aluminum is the same as its dual price (for a maximization problem). The shadow price for aluminum is $3.125 per pound and the maximum allowable increase is 60 pounds. Because 50 is in this range, the $3.125 is valid. Thus, the value of 50 additional pounds is = 50($3.125) = $

Let us consider how a change in the right-hand side for a constraint might affect the feasible region and perhaps cause a change in the optimal solution. The improvement in the value of the optimal solution per unit increase in the right-hand side is called the dual price. The range of RHS is the range over which the dual price is applicable. As the RHS increases, other constraints will become binding and limit the change in the value of the objective function.