Brief summary of linear programming and duality: Consider the linear program in standard form. (P ) min z = cx. x 0. (D) max yb. z = c B x B + c N x N

Similar documents
Worked Examples for Chapter 5

Chap6 Duality Theory and Sensitivity Analysis

Understanding the Simplex algorithm. Standard Optimization Problems.

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

Review Solutions, Exam 2, Operations Research

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

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

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

Summary of the simplex method

Part 1. The Review of Linear Programming

Introduction. Very efficient solution procedure: simplex method.

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

An introductory example

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)

Sensitivity Analysis and Duality in LP

Linear programs, convex polyhedra, extreme points

THE UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS. Operations Research I

c) Place the Coefficients from all Equations into a Simplex Tableau, labeled above with variables indicating their respective columns

Lecture 10: Linear programming duality and sensitivity 0-0

Lecture 10: Linear programming. duality. and. The dual of the LP in standard form. maximize w = b T y (D) subject to A T y c, minimize z = c T x (P)

Sensitivity Analysis

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

Special cases of linear programming

OPERATIONS RESEARCH. Michał Kulej. Business Information Systems

(b) For the change in c 1, use the row corresponding to x 1. The new Row 0 is therefore: 5 + 6

M340(921) Solutions Problem Set 6 (c) 2013, Philip D Loewen. g = 35y y y 3.

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

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

Linear Programming Inverse Projection Theory Chapter 3

F 1 F 2 Daily Requirement Cost N N N

Introduction to linear programming using LEGO.

Chapter 1 Linear Programming. Paragraph 5 Duality

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

Summary of the simplex method

56:270 Final Exam - May

56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker

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

The Simplex Algorithm and Goal Programming

Review Questions, Final Exam

4.7 Sensitivity analysis in Linear Programming

Midterm Review. Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.

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

4. Duality Duality 4.1 Duality of LPs and the duality theorem. min c T x x R n, c R n. s.t. ai Tx = b i i M a i R n

Chapter 4 The Simplex Algorithm Part I

4. Duality and Sensitivity

AM 121 Introduction to Optimization: Models and Methods Example Questions for Midterm 1


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

MATH 445/545 Test 1 Spring 2016

March 13, Duality 3

Thursday, May 24, Linear Programming

Motivating examples Introduction to algorithms Simplex algorithm. On a particular example General algorithm. Duality An application to game theory

Sensitivity Analysis and Duality

Optimisation. 3/10/2010 Tibor Illés Optimisation

Integer programming: an introduction. Alessandro Astolfi

Linear Programming in Matrix Form

Linear and Combinatorial Optimization

Linear Programming Duality

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

Farkas Lemma, Dual Simplex and Sensitivity Analysis

IE 5531: Engineering Optimization I

MATH 210 EXAM 3 FORM A November 24, 2014

A Review of Linear Programming

Linear Programming, Lecture 4

Part IB Optimisation

OPTIMISATION 3: NOTES ON THE SIMPLEX ALGORITHM

Duality Theory, Optimality Conditions

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

Input: System of inequalities or equalities over the reals R. Output: Value for variables that minimizes cost function

The Dual Simplex Algorithm

COT 6936: Topics in Algorithms! Giri Narasimhan. ECS 254A / EC 2443; Phone: x3748

Lecture #21. c T x Ax b. maximize subject to

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

3. Duality: What is duality? Why does it matter? Sensitivity through duality.

Econ 172A, Fall 2007: Midterm A

+ 5x 2. = x x. + x 2. Transform the original system into a system x 2 = x x 1. = x 1

4.3 Minimizing & Mixed Constraints

The Simplex Method. Standard form (max) z c T x = 0 such that Ax = b.

Foundations of Operations Research

Answer the following questions: Q1: Choose the correct answer ( 20 Points ):

3. THE SIMPLEX ALGORITHM

Optimization 4. GAME THEORY

BBM402-Lecture 20: LP Duality

1. Algebraic and geometric treatments Consider an LP problem in the standard form. x 0. Solutions to the system of linear equations

SELECT TWO PROBLEMS (OF A POSSIBLE FOUR) FROM PART ONE, AND FOUR PROBLEMS (OF A POSSIBLE FIVE) FROM PART TWO. PART ONE: TOTAL GRAND

1 Review Session. 1.1 Lecture 2

Overview of course. Introduction to Optimization, DIKU Monday 12 November David Pisinger

9.1 Linear Programs in canonical form

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

Novel update techniques for the revised simplex method (and their application)

Linear programming. Saad Mneimneh. maximize x 1 + x 2 subject to 4x 1 x 2 8 2x 1 + x x 1 2x 2 2

Introduction to optimization

LINEAR PROGRAMMING. Introduction

4.6 Linear Programming duality

Linear Programming and the Simplex method

The Simplex Algorithm

Lecture 7 Duality II

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

Linear Programming: Chapter 5 Duality

OPTIMISATION /09 EXAM PREPARATION GUIDELINES

Transcription:

Brief summary of linear programming and duality: Consider the linear program in standard form (P ) min z = cx s.t. Ax = b x 0 where A R m n, c R 1 n, x R n 1, b R m 1,and its dual (D) max yb s.t. ya c. By letting x = (x B, x N ), x B R m, x N R n m (a partition) we obtain the equivalent systems to (P) min s.t. z = c B x B + c N x N Bx B + Nx N = b x B, x N 0 Supposing that B is nonsingular, we obtain x B = B 1 b B 1 Nx N. By expressing the equation system w.r.t. x N we get min z = c B B 1 b + (c N c B B 1 N)x N (1) s.t. x B = B 1 b B 1 Nx N (2) x B, x N 0 (3) Then the simplex tableau is written as follows: BV z x B x N RHS z 1 0 c B B 1 N c N c B B 1 b x B 0 I B 1 N B 1 b We define the reduced costs according to (1), i.e. as c N := c B B 1 N c N. We generalize the definition to x as c := c B B 1 A c. Observe that c B = 0. Remember that any vertex of the feasible polyhedron can be identified by letting x N = 0 for some N. For x N = 0, we have a solution x = (B 1 b, 0), of value z = c B B 1 b. Such solution is feasible and optimal for the primal if and only if B 1 b 0 (4) c N = c N c B B 1 N 0 (5) 1

For a given B we can find: 1- Quantity of objective function:c B B 1 b 2- Quantity of basic variables: B 1 b 3- Reduced cost: c j := c j c B B 1 a j, for j N 4- Coefficients of x j in column j : B 1 a j, for j N Theorem If B is feasible and optimal for the primal, then y = c B B 1 is a feasible and optimal for the dual. Example1: Consider the following linear programming: By adding the slack variables: (P ) max z = 3x 1 + 5x 2 s.t. x 1 4 2x 2 12 3x 1 + 2x 2 18 x 1, x 2 0 (P ) max z = 3x 1 + 5x 2 s.t. x 1 + s 1 = 4 2x 2 + s 2 = 12 3x 1 + 2x 2 + s 3 = 18 x 1, x 2, s 1, s 2, s 3 0 The optimal simplex tableau is written as follows: BV z x 1 x 2 s 1 s 2 s 3 RHS z 1 0 0 0 3/2 1 36 s 1 0 0 0 1 1/3 1/3 2 x 2 0 0 1 0 1/2 0 6 x 1 0 1 0 0 1/3 1/3 2 s 1,x 2 and x 1 are basic variables; therefore,b and B 1 respectively are: 1 0 1 0 2 0 0 2 3 1 1/3-1/3 0 1/2 0 0 1/3 1/3 2

Sensitivity Analysis: Suppose you solve a linear program by hand ending up with an optimal table (or tableau to use the technical term). You know what an optimal tableau looks like: it has all non-negative values in Row 0 (which we will often refer to as the cost row), all non-negative right-hand-side values, and a basis (identity matrix) embedded. To determine the effect of a change in the data, I will try to determine how that change effected the final tableau, and try to reform the final tableau accordingly;therefore,sensitivity analysis allows us to determine how sensitive the optimal solution is to changes in data values. we analyzing changes in: 1-An Objective Function Coefficient (OFC) 2-A Right Hand Side (RHS) value of a constraint consider the example1 and its optimal tableau: 1-Suppose the cost for x 1 is changed to 4 in the original formulation, from its previous value 3.How this change affected the optimal tableau? a) c j := c B B 1 a j c j c 1 := c B B 1 a 1 c 1, c 1 := (0, 5, 4)B 1 (1, 0, 3) t 4 = 0 c 2 := c B B 1 a 2 c 2, c 2 := (0, 5, 4)B 1 (0, 2, 2) t 5 = 0 c 3 := c B B 1 a 3 c 3, c 3 := (0, 5, 4)B 1 (1, 0, 0) t 0 = 0 c 4 := c B B 1 a 4 c 4, c 4 := (0, 5, 4)B 1 (0, 1, 0) t 0 = 7/6 c 5 := c B B 1 a 5 c 5, c 5 := (0, 5, 4)B 1 (0, 0, 1) t 0 = 4/3 b) z := c B B 1 b z := (0, 5, 4)B 1 (4, 12, 18) t = 38 c) y = c B B 1 y = (0, 5, 4)B 1 = (0, 7/6, 4/3) 2-Suppose the cost for x 1 is changed to 3 + in the original formulation, from its previous value 3.How this change affected the optimal tableau? a) c j := c B B 1 a j c j c 4 := c B B 1 a 4 c 4 0 = c 4 := (0, 5, 3 + )B 1 (0, 1, 0) t 0 0 = 3/2 1/3 0 = 9/2 c 5 := c B B 1 a 5 c 5 0 = (0, 5, 3 + )B 1 (0, 0, 1) t 0 0 = 3 Therefore for any 3 9/2 the tableau remains optimal. Is there any effect on the optimality? Is there any effect on the feasible region? 3

3-Suppose the right hand side is changed to (3, 8, 20) t in the original formulation, from (4, 12, 18) t.how this change affected the optimal tableau? a) z := c B B 1 b z := (0, 5, 3)B 1 (3, 8, 20) t = 32 b) x B := (s 1, x 2, x 1 ) t = B 1 b = (s 1, x 2, x 1 ) t = B 1 (3, 8, 20) t = ( 1, 4, 4) t 4-Suppose the right hand side is changed to (4, 12 2, 18 4 ) t in the original formulation, from (4, 12, 18) t.how this change affected the optimal tableau? a) x B := (s 1, x 2, x 1 ) t = B 1 b 0 = (s 1, x 2, x 1 ) t = B 1 (4, 12 2, 18 4 ) t 0 = (2 1/3, 6, 2 2/3 ) t 0 = 3 Therefore for any 3 9/2 the tableau remains feasible. Is there any effect on the optimality? Is there any effect on the feasible region? Find: 1- z/ b :What is the shadow price for the third constraint? Interpret its value for management. 2- Dual problem of the example1 3- Relationship between optimal objective functions in primal and dual 4

Example2: A company has to determine the best number of three models of a product to produce in order to maximize profits. The models are, an economy model, a standard model, and a deluxe model. Constraints include production capacity limitations (time available in minutes) in each of three departments (cutting and dyeing, sewing, and inspection and packaging) as well as constraint that requires the production of at least 1000 economy models. The linear programming model is shown here: Maxz = 3x 1 + 5x 2 + 4.5x 3 s.t. 12x 1 + 10x 2 + 8x 3 18, 000 Cutting and dying 15x 1 + 15x 2 + 12x 3 18, 000 Sewing 3x 1 + 4x 2 + 2x 3 9, 000 Inspection and modeling x 1 1, 000 Economy model x 1, x 2, x 3 0 Solve the problem using cplex Solver. a) How many units of each model should be produced to maximize the total profit contribution? b) Which constraints are binding? c) Interpret slack and/or surplus in each constraint. d) Overtime rates in the sewing department are $ 12 per hour. Would you recommend that the company consider using overtime in that department? Explain. e) What is the shadow price for the fourth constraint? Interpret its value for management. f) Suppose that the profit contribution of the economy model is increased by $1. How do you expect the solution to change? What is the new value of the objective function (profit)? g) The profit contribution for the standard model is $5 per unit. How much would this profit contribution have to change to make it worthwhile to produce some units of standard model? 5