Lecture 17 - Final Review 1

# Lecture 17 - Final Review 1 - 540:311DETERMINISTICMODELSIN...

This preview shows pages 1–8. Sign up to view the full content.

540:311 DETERMINISTIC MODELS IN OPERATIONS RESEARCH Lecture 17: Final Review 1 Prof. W. Art Chaovalitwongse

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Topics Ch. 4: Simplex Method Ch. 5: Sensi@vity Analysis Graphical Sensi@vity Analysis LINDO Sensi@vity Analysis (including 100% rule) Ch. 6: Matrix Nota@on Simplex Method Sensi@vity Analysis Duality Ch. 8: Network Models Shortest Path Problem Maximum Flow Problem Minimum Spanning Tree Problem Min Cost Network Flow Ch. 9: Integer Programming Modeling Branch and Bound
5.1 – A Graphical Approach to Sensi@vity Analysis SensiDvity analysis is concerned with how changes in an LP ` s parameters afect the op@mal solu@on. max z = 3 x 1 + 2 x 2 2 x 1 + x 2 100 (finishing constraint) x 1 + x 2 80 (carpentry constraint) x 1 40 (demand constraint) x 1 ,x 2 0 (sign restriction) Where: x 1 = number of soldiers produced each week x 2 = number of trains produced each week. Reconsider the Giapetto problem from Chapter 3 shown to the right:

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
5.1 – Change in Obj Fcn Coeﬃcient max z = 3x 1 + 2x 2 slope = -1.5 2 x 1 + x 2 100 x 1 + x 2 80 (carpentry constraint) x 1 40 (demand constraint) x 1 ,x 2 0 (sign restriction) x 1 = number of soldiers produced each week x 2 = number of trains produced each week. X1 X2 10 20 40 50 60 80 20 40 60 80 100 finishing constraint Slope = -2 carpentry constraint Slope = -1 demand constraint Feasible Region A D Isoprofit line z = 120 Slope = -3/2 C B The optimal solution for this LP was z = 180, x 1 = 20, x 2 = 60 ( point B ) z = 2x 1 + 2x 2 slope = -1 z = 1.5x 1 + 2x 2 slope = -0.67 z = 1.5x 1 + 2x 2 z = 4x 1 + 2x 2 slope = -2 z = 4x 1 + 2x 2 z = 5x 1 + 2x 2 slope = -2.5
5.1 – Change in RHS Determine whether a change in the rhs of a constraint will make the current basis no longer optimal . For example, let b 1 = number of available finishing hours. The current optimal solution (point B) is where the carpentry and finishing constraints are binding. If the value of b 1 is changed, then as long as where the carpentry and finishing constraints are binding , the optimal solution will still occur where the carpentry and finishing constraints intersect . !" !# 10 20 40 50 60 80 20 40 60 80 100 finishing constraint Slope = -2 carpentry constraint Slope = -1 demand constraint Feasible Region A D Isoprofit line z = 120 Slope = -3/2 C B

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
5.1 – A Graphical Approach to Sensi@vity Analysis max z = 3x 1 + 2x 2 slope = -1.5 2 x 1 + x 2 100 (finishing constraint) x 1 + x 2 80 (carpentry constraint) x 1 40 (demand constraint) x 1 ,x 2 0 (sign restriction) x 1 = number of soldiers produced each week x 2 = number of trains produced each week. X1 X2 10 20 40 50 60 80 20 40 60 80 100 finishing constraint Slope = -2 carpentry constraint Slope = -1 demand constraint Feasible Region A D Isoprofit line z = 120 Slope = -3/2 C B The optimal solution for this LP was z = 180, x 1 = 20, x 2 = 60 ( point B ) 2 x 1 + x 2 80 2 x 1 + x 2 40 2 x 1 + x 2 120 2 x 1 + x 2 80 2 x 1 + x 2 40 2 x 1 + x 2 120 2 x 1 + x 2 100 2 x 1 + x 2 140 2 x 1 + x 2 140
5.1 – Shadow Price To determine how a change in a constraint ` s rhs changes the LP ` s op@mal z‐value ‐ only if the change in the rhs of constraint i

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 09/20/2011 for the course ENG 300 taught by Professor Albin during the Fall '11 term at Rutgers.

### Page1 / 38

Lecture 17 - Final Review 1 - 540:311DETERMINISTICMODELSIN...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online