Math Models of OR: Sensitivity Analysis

Similar documents
Math Models of OR: Some Definitions

Math Models of OR: Handling Upper Bounds in Simplex

Slack Variable. Max Z= 3x 1 + 4x 2 + 5X 3. Subject to: X 1 + X 2 + X x 1 + 4x 2 + X X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0

Math Models of OR: Extreme Points and Basic Feasible Solutions

Math Models of OR: The Revised Simplex Method

Worked Examples for Chapter 5

Simplex Algorithm Using Canonical Tableaus

Lecture 11: Post-Optimal Analysis. September 23, 2009

The use of shadow price is an example of sensitivity analysis. Duality theory can be applied to do other kind of sensitivity analysis:

Part 1. The Review of Linear Programming

21. Solve the LP given in Exercise 19 using the big-m method discussed in Exercise 20.

Sensitivity Analysis

Dual Basic Solutions. Observation 5.7. Consider LP in standard form with A 2 R m n,rank(a) =m, and dual LP:

Math Models of OR: Traveling Salesman Problem

Math Homework 3: solutions. 1. Consider the region defined by the following constraints: x 1 + x 2 2 x 1 + 2x 2 6

Note 3: LP Duality. If the primal problem (P) in the canonical form is min Z = n (1) then the dual problem (D) in the canonical form is max W = m (2)

Standard Form An LP is in standard form when: All variables are non-negativenegative All constraints are equalities Putting an LP formulation into sta

Farkas Lemma, Dual Simplex and Sensitivity Analysis

Lecture 5 Simplex Method. September 2, 2009

The Simplex Method. Lecture 5 Standard and Canonical Forms and Setting up the Tableau. Lecture 5 Slide 1. FOMGT 353 Introduction to Management Science

Foundations of Operations Research

Review Solutions, Exam 2, Operations Research

Chap6 Duality Theory and Sensitivity Analysis

(P ) Minimize 4x 1 + 6x 2 + 5x 3 s.t. 2x 1 3x 3 3 3x 2 2x 3 6

F 1 F 2 Daily Requirement Cost N N N

9.1 Linear Programs in canonical form

The Simplex Method. Formulate Constrained Maximization or Minimization Problem. Convert to Standard Form. Convert to Canonical Form

AM 121: Intro to Optimization

Special cases of linear programming

Introduction to Mathematical Programming IE406. Lecture 13. Dr. Ted Ralphs

Chapter 1 Linear Programming. Paragraph 5 Duality

Yinyu Ye, MS&E, Stanford MS&E310 Lecture Note #06. The Simplex Method

Lesson 27 Linear Programming; The Simplex Method

Linear programs Optimization Geoff Gordon Ryan Tibshirani


(includes both Phases I & II)

Simplex tableau CE 377K. April 2, 2015

IP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, You wish to solve the IP below with a cutting plane technique.

CSC Design and Analysis of Algorithms. LP Shader Electronics Example

Prelude to the Simplex Algorithm. The Algebraic Approach The search for extreme point solutions.

Slide 1 Math 1520, Lecture 10

The augmented form of this LP is the following linear system of equations:

1 Review Session. 1.1 Lecture 2

(includes both Phases I & II)

x 4 = 40 +2x 5 +6x x 6 x 1 = 10 2x x 6 x 3 = 20 +x 5 x x 6 z = 540 3x 5 x 2 3x 6 x 4 x 5 x 6 x x

min 4x 1 5x 2 + 3x 3 s.t. x 1 + 2x 2 + x 3 = 10 x 1 x 2 6 x 1 + 3x 2 + x 3 14

DEPARTMENT OF STATISTICS AND OPERATIONS RESEARCH OPERATIONS RESEARCH DETERMINISTIC QUALIFYING EXAMINATION. Part I: Short Questions

Metode Kuantitatif Bisnis. Week 4 Linear Programming Simplex Method - Minimize

min3x 1 + 4x 2 + 5x 3 2x 1 + 2x 2 + x 3 6 x 1 + 2x 2 + 3x 3 5 x 1, x 2, x 3 0.

OPERATIONS RESEARCH. Michał Kulej. Business Information Systems

Foundations of Operations Research

Lecture 14 Transportation Algorithm. October 9, 2009

SAMPLE QUESTIONS. b = (30, 20, 40, 10, 50) T, c = (650, 1000, 1350, 1600, 1900) T.

CPS 616 ITERATIVE IMPROVEMENTS 10-1

Sensitivity Analysis and Duality in LP

LINEAR PROGRAMMING 2. In many business and policy making situations the following type of problem is encountered:

IEOR 4404 Homework #4 Intro OR: Deterministic Models February 28, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #4

Math 5593 Linear Programming Problem Set 4

CO350 Linear Programming Chapter 8: Degeneracy and Finite Termination

Part 1. The Review of Linear Programming

IE 400: Principles of Engineering Management. Simplex Method Continued

UNIVERSITY of LIMERICK

Dr. Maddah ENMG 500 Engineering Management I 10/21/07

The Ellipsoid Algorithm

Linear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004

MATH 445/545 Homework 2: Due March 3rd, 2016

Systems Analysis in Construction

IE 5531: Engineering Optimization I

4.7 Sensitivity analysis in Linear Programming

4. Duality and Sensitivity

A Review of Linear Programming

Notes on Simplex Algorithm

Simplex Method in different guises

Integer and Combinatorial Optimization: Introduction

maxz = 3x 1 +4x 2 2x 1 +x 2 6 2x 1 +3x 2 9 x 1,x 2

MATH 445/545 Test 1 Spring 2016

Introduction to Mathematical Programming IE406. Lecture 10. Dr. Ted Ralphs

END3033 Operations Research I Sensitivity Analysis & Duality. to accompany Operations Research: Applications and Algorithms Fatih Cavdur

CO 602/CM 740: Fundamentals of Optimization Problem Set 4

Example. 1 Rows 1,..., m of the simplex tableau remain lexicographically positive

Introduction. Very efficient solution procedure: simplex method.

Summary of the simplex method

MVE165/MMG631 Linear and integer optimization with applications Lecture 5 Linear programming duality and sensitivity analysis

Simplex Method for LP (II)

March 13, Duality 3

Sensitivity Analysis and Duality

Ω R n is called the constraint set or feasible set. x 1

MATH 373 Section A1. Final Exam. Dr. J. Bowman 17 December :00 17:00

Chapter 4 The Simplex Algorithm Part I

Lecture 2: The Simplex method

The Simplex Algorithm

Lecture 4: Algebra, Geometry, and Complexity of the Simplex Method. Reading: Sections 2.6.4, 3.5,

TIM 206 Lecture 3: The Simplex Method

Section Notes 9. IP: Cutting Planes. Applied Math 121. Week of April 12, 2010

Lecture Simplex Issues: Number of Pivots. ORIE 6300 Mathematical Programming I October 9, 2014

DM545 Linear and Integer Programming. Lecture 7 Revised Simplex Method. Marco Chiarandini

Linear Programming: Simplex Method CHAPTER The Simplex Tableau; Pivoting

The simplex algorithm

Linear programming on Cell/BE

AM 121: Intro to Optimization Models and Methods Fall 2018

Transcription:

Math Models of OR: Sensitivity Analysis John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 8 USA October 8 Mitchell Sensitivity Analysis / 9

Optimal tableau and pivot matrix Outline Optimal tableau and pivot matrix Increase nonbasic variable Increase resource available Change selling price 5 New product available 6 Additional constraints violated by current solution Mitchell Sensitivity Analysis / 9

Optimal tableau and pivot matrix An example problem Consider the linear programming problem min x x s.t. x + x x + x 6 (P) x x 6 x i i =,. How does the optimal solution change if the problem changes? How sensitive is the solution to the parameters? Mitchell Sensitivity Analysis / 9

Optimal tableau and pivot matrix Graphing the problem x x x = x + x = 6, x = x x = 6, x 5 = (,) x + x =, x = x Mitchell Sensitivity Analysis / 9

Optimal tableau and pivot matrix Tableaus The initial tableau for this problem with slack variables x, x, x 5 is M = x x x x x 5 6 6 The optimal tableau for this problem is M = x x x x x 5 7 Mitchell Sensitivity Analysis 5 / 9

Optimal tableau and pivot matrix Pivot matrix The pivot matrix Q satisfying M = QM is Q = 7. Mitchell Sensitivity Analysis 6 / 9

Increase nonbasic variable Outline Optimal tableau and pivot matrix Increase nonbasic variable Increase resource available Change selling price 5 New product available 6 Additional constraints violated by current solution Mitchell Sensitivity Analysis 7 / 9

Increase nonbasic variable Increase a nonbasic variable Want x = a >, with a fixed. How to get new optimal solution? What if a >? Approach: place the x column into the right hand side column. Reoptimize using dual simplex if necessary. Modified optimal tableau is: M = x x x x 5 x + 7 x x x The modified tableau is in optimal form if 6 7 x, with optimal value + x. The same variables are basic, but their values have changed. We now have x = x, x = x, x = + 7 x. Mitchell Sensitivity Analysis 8 / 9

Increase nonbasic variable Graphing the modified problem x x + x = 6, x = x x = + a x x = 6, x 5 = x + x = 6 a, x = a (,) x + x =, x = ( a, a) x Mitchell Sensitivity Analysis 9 / 9

Increase nonbasic variable Larger changes in x If x = a >, then we need to use dual simplex to reoptimize. x x x x 5 x + 7 x x x x x x x 5 x 6 + x 6 + x 6 x The variable x is now nonbasic, and x 5 is basic. The updated objective function value is + x, so the shadow price has increased to as the resource is consumed. This updated tableau is in optimal form provided x 6. If x increases beyond 6 then further reoptimization using dual simplex is required (the problem becomes infeasible). Mitchell Sensitivity Analysis / 9

Increase nonbasic variable Graphing the modified problem x x + x = 6, x = x x = 6, x 5 = x + x =, x = x x = + a x + x = 6 a, x = a (,) (6 a, ) x Mitchell Sensitivity Analysis / 9

Increase resource available Outline Optimal tableau and pivot matrix Increase nonbasic variable Increase resource available Change selling price 5 New product available 6 Additional constraints violated by current solution Mitchell Sensitivity Analysis / 9

Increase resource available Increase resource available Change second constraint to x + x 6 + h with h >. How does the solution change? Approach: Change M to M h, then calculate M h = QM h. Reoptimize using dual simplex if necessary. We have M h = x x x x x 5 6 + h 6 Mitchell Sensitivity Analysis / 9

Increase resource available Calculate the updated tableau QM h = 7 6 + h 6 = + h 7 h 7 + h + h Notice that only the b-column of the tableau has changed. This tableau is in optimal form provided h 6 7. Mitchell Sensitivity Analysis / 9

Increase resource available Graphing the modified problem x x + x = 6, x = x x = h x + x = 6 + h, x = h x x = 6, x 5 = (,) ( + h, + h) x + x =, x = Mitchell Sensitivity Analysis 5 / 9 x

Increase resource available Graphing the modified problem x x + x = 6, x = x x = h x + x = 6 + h, x = h x x = 6, x 5 = (,) ( 7, 7 ) x + x =, x = Mitchell Sensitivity Analysis 5 / 9 x

Change selling price Outline Optimal tableau and pivot matrix Increase nonbasic variable Increase resource available Change selling price 5 New product available 6 Additional constraints violated by current solution Mitchell Sensitivity Analysis 6 / 9

Change selling price Change selling price Change objective function to min x ( + q)x. How does the solution change? Approach: Change M to M q, then calculate M q = QM q. Recover canonical form. Reoptimize using simplex if necessary. We have M q = x x x x x 5 q 6 6 Mitchell Sensitivity Analysis 7 / 9

Change selling price Calculate new tableau QM q = 7 q 6 6 = q 7 Notice that the only change in the optimal tableau is to the reduced cost for x. The same result would hold even if a nonbasic cost coefficient was changed instead. Mitchell Sensitivity Analysis 8 / 9

Change selling price Recover canonical form Since x was basic in M, the new tableau is no longer in canonical form. Pivoting on the x entry in R gives the updated tableau x x x x x 5 + q + q q 7 This is still in optimal form provided q. If q >, no longer in optimal form, and x 5 enters the basis. Mitchell Sensitivity Analysis 9 / 9

Change selling price Reoptimize From the minimum ratio test, x leaves the basis and the updated tableau is x x x x x 5 9 + q + q 5 q 7 This tableau is in optimal form provided q 5. Mitchell Sensitivity Analysis / 9

Change selling price Graphing the modified problem x x + x = 6, x = x x = 6, x 5 = (,) (,) x ( + q)x = 9 q x + x =, x = x Mitchell Sensitivity Analysis / 9

New product available Outline Optimal tableau and pivot matrix Increase nonbasic variable Increase resource available Change selling price 5 New product available 6 Additional constraints violated by current solution Mitchell Sensitivity Analysis / 9

New product available New product available Have new product x 6, and change the LP to min x x x 6 s.t. x + x + x 6 x + x + x 6 6 (P) x x + x 6 6 x i i =,, 6. How does the solution change? Approach: Change M to M p, then calculate M p = QM p. Reoptimize using simplex if necessary. M p = x x x x x 5 x 6 6 6 Mitchell Sensitivity Analysis / 9

New product available Calculate updated optimal tableau QM p = 7 6 6 = 7 Notice that the only change is in the x 6 column. No longer in optimal form, so need to reoptimize using simplex: x 6 enters the basis; from the minimum ratio test, x leaves the basis. Mitchell Sensitivity Analysis / 9

Outline Additional constraints violated by current solution Optimal tableau and pivot matrix Increase nonbasic variable Increase resource available Change selling price 5 New product available 6 Additional constraints violated by current solution Mitchell Sensitivity Analysis 5 / 9

Additional constraints violated by current solution Add additional constraints Approach: Recover canonical form. Reoptimize using dual simplex. For example: add the constraint x x. Adding this constraint to M with slack variable x 6 gives the tableau M = x x x x x 5 x 6 7 Mitchell Sensitivity Analysis 6 / 9

Additional constraints violated by current solution Graphing the modified problem x x x = 6 (.5,.5) x x =, x 6 = x x = 6, x 5 = (,) x + x = 6, x = x + x =, x = x Mitchell Sensitivity Analysis 7 / 9

Additional constraints violated by current solution Get (dual) canonical form M = x x x x x 5 x 6 7 R R, R + R x x x x x 5 x 6 7 Need to reoptimize using dual simplex. x 6 replaced by x 5 in basis. Mitchell Sensitivity Analysis 8 / 9

Additional constraints violated by current solution Pivot to optimality x x x x x 5 x 6 8-6 This is in optimal form. x x x x x 5 x 6 6 5 6 7 Mitchell Sensitivity Analysis 9 / 9