Discuss mainly the standard inequality case: max. Maximize Profit given limited resources. each constraint associated to a resource

Similar documents
5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY

Section Notes 4. Duality, Sensitivity, and the Dual Simplex Algorithm. Applied Math / Engineering Sciences 121. Week of October 8, 2018

AM 121: Intro to Optimization Models and Methods Fall 2017

Section Notes 5. Review of Linear Programming. Applied Math / Engineering Sciences 121. Week of October 15, 2017

Advanced Operations Research Techniques IE316. Quiz 2 Review. Dr. Ted Ralphs

Assignment #3 - Solutions MATH 3300A (01) Optimization Fall 2015

4.1 The original problem and the optimal tableau

Econ 172A - Slides from Lecture 8

Linear Programming. Linear programming provides methods for allocating limited resources among competing activities in an optimal way.

Math Introduction to Operations Research

The Ascendance of the Dual Simplex Method: A Geometric View

Introduction. Linear because it requires linear functions. Programming as synonymous of planning.

Marginal and Sensitivity Analyses

Read: H&L chapters 1-6

Civil Engineering Systems Analysis Lecture XIV. Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics

Introduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs

Econ 172A - Slides from Lecture 9

Farming Example. Lecture 22. Solving a Linear Program. withthe Simplex Algorithm and with Excel s Solver

Linear Programming Problems

Graphical Analysis. Figure 1. Copyright c 1997 by Awi Federgruen. All rights reserved.

Linear Programming. Revised Simplex Method, Duality of LP problems and Sensitivity analysis

These definitions are only useful within the graphical solution of LP models. Thus, a more general definition is required.

Controlling Air Pollution. A quick review. Reclaiming Solid Wastes. Chapter 4 The Simplex Method. Solving the Bake Sale problem. How to move?

MATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS

CSE 40/60236 Sam Bailey

BCN Decision and Risk Analysis. Syed M. Ahmed, Ph.D.

Linear programming II João Carlos Lourenço

Some Advanced Topics in Linear Programming

Mid-term Exam of Operations Research

Part 4. Decomposition Algorithms Dantzig-Wolf Decomposition Algorithm

Lecture 9: Linear Programming

Tuesday, April 10. The Network Simplex Method for Solving the Minimum Cost Flow Problem

Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Civil Engineering Systems Analysis Lecture XV. Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics

Chapter 2 An Introduction to Linear Programming

INEN 420 Final Review

VARIANTS OF THE SIMPLEX METHOD

Simulation. Lecture O1 Optimization: Linear Programming. Saeed Bastani April 2016

Linear Programming has been used to:

Optimization of Design. Lecturer:Dung-An Wang Lecture 8

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Outline. CS38 Introduction to Algorithms. Linear programming 5/21/2014. Linear programming. Lecture 15 May 20, 2014

Lesson 11: Duality in linear programming

Chapter II. Linear Programming

Solutions for Operations Research Final Exam

SEN301 OPERATIONS RESEARCH I PREVIUOS EXAM QUESTIONS

Unit.9 Integer Programming

Linear Programming. Larry Blume. Cornell University & The Santa Fe Institute & IHS

Linear Programming Motivation: The Diet Problem

Linear Programming Applications. Software for Linear Programming

February 10, 2005

Duality. Primal program P: Maximize n. Dual program D: Minimize m. j=1 c jx j subject to n. j=1. i=1 b iy i subject to m. i=1

Chapter 2--An Introduction to Linear Programming

Department of Mathematics Oleg Burdakov of 30 October Consider the following linear programming problem (LP):

MATLAB Solution of Linear Programming Problems

Prepared By. Handaru Jati, Ph.D. Universitas Negeri Yogyakarta.

Math 414 Lecture 30. The greedy algorithm provides the initial transportation matrix.

Module 4 Lecture Notes 1. Use of software for solving linear programming problems

Chapter 3: Towards the Simplex Method for Efficient Solution of Linear Programs

Modeling the Duality Extraction for Linear Programming Models

3 INTEGER LINEAR PROGRAMMING

Simplex Method. Introduction:

Linear Mathematical Programming (LP)

COLUMN GENERATION IN LINEAR PROGRAMMING

Linear programming and duality theory

Linear Optimization. Andongwisye John. November 17, Linkoping University. Andongwisye John (Linkoping University) November 17, / 25

Linear Programming. Course review MS-E2140. v. 1.1

Repetition: Primal Dual for Set Cover

16.410/413 Principles of Autonomy and Decision Making

LP Graphic Solution & Solver for LP

Chapter 2 - An Introduction to Linear Programming

Optimization Methods in Management Science

Chapter 4: The Mechanics of the Simplex Method

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs

George B. Dantzig Mukund N. Thapa. Linear Programming. 1: Introduction. With 87 Illustrations. Springer

Homework 2: Multi-unit combinatorial auctions (due Nov. 7 before class)

Linear Programming Terminology

ECE 307- Techniques for Engineering Decisions

Lecture 5: Duality Theory

SENSITIVITY. CS4491 Introduction to Computational Models with Python

Linear programming tutorial

4.1 Graphical solution of a linear program and standard form

The Islamic University of Gaza Faculty of Commerce Quantitative Analysis - Dr. Samir Safi Midterm #2-28/4/2014

Introduction to Operations Research

Other Algorithms for Linear Programming Chapter 7

CHAPTER 11: BASIC LINEAR PROGRAMMING CONCEPTS

Let s start by examining an Excel worksheet for the linear programming. Maximize P 70x 120y. subject to

Chapter 13-1 Notes Page 1

Approximation Algorithms

Graphs that have the feasible bases of a given linear

MULTIMEDIA UNIVERSITY FACULTY OF ENGINEERING PEM2046 ENGINEERING MATHEMATICS IV TUTORIAL

Solving Linear Programs Using the Simplex Method (Manual)

II. Linear Programming

Artificial Intelligence

ONLY AVAILABLE IN ELECTRONIC FORM

How to Solve a Standard Maximization Problem Using the Simplex Method and the Rowops Program

THE simplex algorithm [1] has been popularly used

CASE STUDY. fourteen. Animating The Simplex Method. case study OVERVIEW. Application Overview and Model Development.


What s Linear Programming? Often your try is to maximize or minimize an objective within given constraints

Transcription:

Sensitivity Analysis Discuss mainly the standard inequality case: ma s.t. n a i, z n b, i c i,, m s.t.,,, n ma Maimize Profit given limited resources each constraint associated to a resource Alternate interpretations of shadow price and reduced cost Sensitivity Analysis using GAMS output n a i, z ni n c b, i i,, m,,, n, n,..., nm Shadow Price Def: Shadow Price of constraint (resource) i The shadow price of resource i is the amount that the optimal obective value will change with an additional unit of that resource Other interpretations: Opportunity cost of using one unit of that resource (e.g. adding new activity) Marginal worth of an additional unit of that resource Market price of that resource (Duality) Also know as: Dual Variable

Shadow Price Thm: Suppose optimal solution of a Std Ineq or Eq LP is nondegenerate (i.e. all basic variable strictly positive) If the RHS of the i th constraint is changed from b i to b i + ( sufficiently small), then the i th dual variable, y i, is the shadow price of that constraint/resource. Shadow Price/Dual Variable & Reduced Cost In CO5, the formula for reduced cost is: c c T A y, Can we find the shadow price from the final tableau? In standard inequality form: If s i is the slack variable of row i, then the shadow price for row i is negative of the reduced cost of s i

New Activity GTC is thinking about making hammers Each hammer requires lb of steel, hour of molding and.4 hours of assembly Price of hammers are $ per thousand hammers Without solving a new LP, can you tell if GTC should bother making hammers? ma s. t..5.,.5 7 9 (steel) (molding) (assembly) Final Tableau: Basic variables z s Current values 46 9.9 6 -.4 4 4 - -.9 5 Pricing Out an Activity We need to find the reduced cost for hammers, given the current optimal solution: i.e. find marginal contribution of hammers to obective value (revenue) Revenue: K unit of hammers gives us $ in revenue Cost: Opportunity cost of diverting resources away from current optimal production mi to make hammers Think of shadow prices as opportunity cost of using that resources (i.e., effect on opt value when RHS increases by -) Find Total Opportunity Cost: Resource Required to make hammer Opportunity Cost Total Steel Molding Assembly 4

Pricing Out an Activity Net Marginal contribution = Contribution to Revenue _ Total Opportunity Costs Reduced Costs = Original Obective Coefficient _ Shadow Price * Resources Required Pricing Out an Activity So producing K units of hammers will decreasing obective value by $-6, so GTC does not want to make hammers We didn t need to solve a new LP How can we re-price hammers so that it would become attractive to produce hammers? Shadow Prices (Opportunity Costs) can be used to determine prices of new products 5

Pricing Out an Activity If the Price of hammers were $, what would we do net? Reduced Cost = Would it be attractive to produce hammers? Changes in LP Data Suppose the price of wrenches or pliers change, or the resource availability changes: Changes in Obective Coefficient for nonbasic and basic variables: Current Solution always remain feasible when we change the obective coefficients but it may no longer be optimal Changes in RHS vector for non-binding and binding constraints: The optimality (reduced costs) of the Primal is not affected, but the current basis may no longer be feasible. 6

Changes in Obective Coefficients of Nonbasic Variable Final Tableau: Basic variables z 5 Current values 46 What happens when we decrease c? 9.9 6 -.4 4 4 - -.9 5 What happens when we increase c? Changes in Obective Coefficients of NBV Let s link this to the Simple Method: z 6 4 4 z yi a i, i,,,.., 5 7

Changes in Obective Coefficients of Basic Variables What happens when we decrease c? What happens when we increase c? Changes in Obective Coefficients of BV Let s link this to the Simple Method: z 6 4 4 z z (c ) yi a i, i,,,.., 5 yi a i, i,,,.., 5 8

Changes in Obective Coefficients of BV Basic variables Current values 4 5 z 46 -c 6 4-9 - 5.9.4 -.9 But since it s z-row coefficient must be Make its z-row coefficient by adding c times row to z-row New z-row becomes: Changes in Right-Hand-Side Changing the RHS will clearly change the values of the current optimal solution, so the current basis may become infeasible However, it does not affect the optimality condition If the basis is the same, then the shadow price/dual variables and reduced costs are the same Analyze effects of changes RHS for: Nonbinding constraints (LHS < RHS) Binding constraints (LHS = RHS) 9

Changes in RHS of Nonbinding Constraint What happens when we change the RHS of the assembly constraint:. b.5 9 In the optimal solution, 5 =.9 so the constraint is nonbinding, thus its shadow price is (why?) What happens if we increase b? What happens if we decrease b? Changes in RHS of Binding Constraint What happens when we change the RHS of the steel constraint:.5 7b In the optimal solution, =, so the constraint is binding. Changing the RHS by b is the same as decreasing slack variable 5 (nonbasic so current =) by b How does this effect the current basic feasible solution?

Changes in RHS of Binding Constraint Final Tableau: Basic variables Current values 4 5 z 46 6 4-9 - 5.9.4 -.9 Dual Simple Method New Final Tableau: Basic variables z 6 Current values 4 5 46 + 6b 6 4 + b - 9 - b -.9 +.4b.4 -.9 What happens if we increase b by 5? ( b = +5)