# 4.6 Linear Programming duality

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP. Different spaces and objective functions but in general same optimal objective function value. Example: The value of a maximum feasible flow is equal to the capacity of a cut (separating the source s and the sink t) of minimum capacity. E. Amaldi Foundations of Operations Research Politecnico di Milano 1

2 Motivation: estimate of the optimal value Given max z = 4x 1 + x 2 + 5x 3 + 3x 4 x 1 x 2 x 3 + 3x 4 1 (I) 5x 1 + x 2 + 3x 3 + 8x 4 55 (II) -x 1 + 2x 2 + 3x 3 5x 4 3 (III) x i 0 i =1,, 4 find an estimate of the optimal value z *. Any feasible solution is a lower bound. Lower bounds: (0,0,1,0) z * 5 (2,1,1,1/3) z * 15 (3,0,2,0) z * 22 Even if we are lucky, we are not sure it is the optimal solution! E. Amaldi Foundations of Operations Research Politecnico di Milano 2

3 Upper bounds: By multiplying 5x 1 + x 2 + 3x 3 + 8x 4 55 (II) by 5/3, we obtain an inequality that dominates the objective function: 4x 1 + x 2 + 5x 3 + 3x 4 25/3x 1 + 5/3x 2 + 5x /3x 4 275/3 feasible solution z * 275/3. By adding constraints (II) and (III), we obtain: 4x 1 + 3x 2 + 6x 3 + 3x 4 58 z * 58 better upper bound. Linear combinations with nonnegative multipliers of inequality constraints yields valid inequalities E. Amaldi Foundations of Operations Research Politecnico di Milano 3

4 General strategy: Linearly combine the constraints with nonnegative multiplicative factors ( i-th constraint multiplied by y i 0 ). first case: y 1 =0, y 2 =5/3, y 3 =0 second case: y 1 =0, y 2 =1, y 3 =1 In general, such linear combination of (I), (II), (III) reads y 1 (x 1 x 2 x 3 +3x 4 ) + y 2 (5x 1 + x 2 + 3x 3 + 8x 4 ) + y 3 (-x 1 + 2x 2 + 3x 3 5x 4 ) y y 2 + 3y 3 E. Amaldi Foundations of Operations Research Politecnico di Milano 4

5 which is equivalent to: (y 1 + 5y 2 y 3 ) x 1 + (-y 1 + y 2 + 2y 3 ) x 2 + (-y 1 + 3y 2 + 3y 3 ) x 3 + (3y 1 + 8y 2 5y 3 ) x 4 y y 2 + 3y 3 (*) Observation: y i 0 so that the inequality direction is unchanged. In order to use the left hand side of (*) as upper bound on z = 4x 1 + x 2 + 5x 3 + 3x 4 E. Amaldi Foundations of Operations Research Politecnico di Milano 5

6 z = 4x 1 + x 2 + 5x 3 + 3x 4 we must have y 1 + 5y 2 y 3 4 -y 1 + y 2 + 2y 3 1 -y 1 + 3y 2 + 3y 3 5 3y 1 + 8y 2 5y 3 3 y i 0, i =1, 2, 3. In such a case, any feasible solution x satisfies 4x 1 + x 2 + 5x 3 + 3x 4 y y 2 + 3y 3 In particular: z * y y 2 + 3y 3 E. Amaldi Foundations of Operations Research Politecnico di Milano 6

7 Since we look for the best possible upper bound on z * : (D) min y y 2 + 3y 3 Original problem: max z = 4x 1 + x 2 + 5x 3 + 3x 4 y 1 + 5y 2 y 3 4 -y 1 + y 2 + 2y 3 1 -y 1 + 3y 2 + 3y 3 5 3y 1 + 8y 2 5y 3 3 y i 0 i =1, 2, 3 x 1 x 2 x 3 + 3x 4 1 (I) 5x 1 + x 2 + 3x 3 + 8x 4 55 (II) -x 1 + 2x 2 + 3x 3 5x 4 3 (III) x i 0 i =1,, 4 Definition: The problem (D) is the dual problem, while the original problem is the primal problem. E. Amaldi Foundations of Operations Research Politecnico di Milano 7

8 In matrix form: max z = c T x Primal (P) Ax b x 0 min w=b T y Dual (D) A T y c y 0 or y T A c T E. Amaldi Foundations of Operations Research Politecnico di Milano 8

9 Dual problem max z = c T x min w=b T y (P) Ax b x 0 (D) A T y c y 0 Dual of an LP in standard form? min z=c T x Ax = b x 0 E. Amaldi Foundations of Operations Research Politecnico di Milano 9

10 Standard form: (P) min z = c T x Ax = b x 0 with A an mn matrix -max -c T x A b -A x -b x 0 dual A x b A T - min (b T -b T ) y 1 y 2 y 1 y 2 (A T -A T ) -c y 1 0, y 2 0 y = y 1 y 2 E. Amaldi Foundations of Operations Research Politecnico di Milano 10

11 - min (b T -b T ) y 1 y 2 y 1 y 2 (A T -A T ) -c y 1 0, y 2 0 (D) max w=b T y A T y c y R m y y 2 y 1 unrestricted in sign! -min -b T (y 2 -y 1 ) -A T (y 2 -y 1 ) -c y 1 0, y 2 0 E. Amaldi Foundations of Operations Research Politecnico di Milano 11

12 Property: The dual of the dual problem coincides with the primal problem. max (P) z = c T x Ax b x 0 min (D) w=b T y A T y c y 0 Observation: it doesn't matter which one is a maximum or minimum problem. E. Amaldi Foundations of Operations Research Politecnico di Milano 12

13 General transformation rules Primal (min) Dual (max) m constraints n variables coefficients obj. fct right hand side A equality constraints unrestriced variables inequality constraints ( ) variables 0 ( 0) m variables n constraints right hand side coefficients obj. fct E. Amaldi Foundations of Operations Research Politecnico di Milano 13 A T unrestriced variables equality constraints variables 0 ( 0) inequality constraints ( )

14 Example: (P) max x 1 + x 2 x 1 x 2 2 3x 1 + 2x 2 12 x 1, x 2 0 max x 1 + x 2 x 1 - x 2 2-3x 1-2x 2-12 x 1, x 2 0 dual min 2y 1-12y 2 y 1-3y 2 1 -y 1-2y 2 1 y 1, y 2 0 E. Amaldi Foundations of Operations Research Politecnico di Milano 14

15 Example: using the above rules (P) max x 1 + x 2 x 1 x x 1 + 2x 2 12 x 1, x 2 0 dual min 2y y 2 y 1 + 3y 2 1 -y 1 + 2y 2 1 y 1 0, y 2 0 y~ 1 -y 1 min 2y 1-12y ~ 2 y 1-3y ~ 2 1 -y 1-2y ~ 2 1 y 1 0, y~ 2 0 E. Amaldi Foundations of Operations Research Politecnico di Milano 15

16 Exercize: (P) min 10x x x 3 2x 1 x 2 1 x 2 + x 3 2 x 1 x 3 = 3 x 1 0, x 2 0, x 3 unrestricted Dual? E. Amaldi Foundations of Operations Research Politecnico di Milano 16

17 Weak duality theorem min (P) z = c T x Ax b x 0 max (D) w=b T y A T y c y 0 X {x : Ax b, x 0} ø and Y {y : A T y c, y 0} ø, For each feasible solution x X of (P) and each feasible solution y Y of (D) we have b T y c T x. E. Amaldi Foundations of Operations Research Politecnico di Milano 17

18 Proof Given x X and y Y, we have Ax b, x 0 and A T y c, y 0 which imply that b T y x T A T y x T c = c T x x T A T c E. Amaldi Foundations of Operations Research Politecnico di Milano 18

19 Consequence: If x * is a feasible solution for the primal problem (P) ( x * X ), y * is a feasible solution (D) ( y * Y ), and the values of the respective objective functions coincide then c T x * = b T y *, x * is optimal for (P) and y * is optimal for (D). E. Amaldi Foundations of Operations Research Politecnico di Milano 19

20 Strong duality theorem If X = {x : Ax b, x 0} ø and min{c T x : x X}isfinite, there exist x * X and y * Y such that c T x * = b T y *. min{ c T x : x X } = max{ b T y : y Y } optimum z = c T x x X feasible for (P) z * = w * w = b T y y Y feasible for (D) E. Amaldi Foundations of Operations Research Politecnico di Milano 20

21 Proof Derive an optimal solution of (D) from one of (P) Given min c T x max y T b (P) Ax = b x 0 (D) y T A c T y R m and x* is an optimal feasible solution of (P) x x* = * B with x * N x * B = B -1 b x * N = 0 provided (after a finite of iterations) by the Simplex algorithm with Bland's rule. E. Amaldi Foundations of Operations Research Politecnico di Milano 21

22 Let us consider y T c T B B -1 y is a feasible solution of (D): c T N = c T N (c T B B -1 )N = c T N y T N 0 T reduced costs of the nonbasic variables optimality of x * y T N c T N E. Amaldi Foundations of Operations Research Politecnico di Milano 22

23 c T B = c T B (c T B B -1 )B = c T B y T B = 0 T y T B c T B reduced costs of the basic variables I y is an optimal solution of (D): y T b= (c T B B -1 )b= c T B (B -1 b) = c T B x * B = c T x * Hence y = y * E. Amaldi Foundations of Operations Research Politecnico di Milano 23

24 Corollary For any pair of primal-dual problems (P) and (D), only four cases can arise: P D optimal solution unbounded LP Infeasible LP optimal solution 1) unbounded LP infeasible LP 2) 3) 4) E. Amaldi Foundations of Operations Research Politecnico di Milano 24

25 Strong duality theorem 1) Weak duality theorem 2) and 3) 4) can arise: (P) min -4x 1 2x 2 -x 1 + x 2 2 x 1 x 2 1 x 1, x 2 0 (D) max 2y 1 + y 2 -y 1 + y 2-4 y 1 y 2-2 y 1, y 2 0 empty feasible regions E. Amaldi Foundations of Operations Research Politecnico di Milano 25

26 Economic interpretation The primal and dual problems correspond to two complementary point of views on the same market. Diet problem: n aliments j=1,, n m nutrients i=1,, m (vitamines, ) a ij b i c j quantity of i-th nutrient in one unit of j-th aliment requirement of i-th nutrient cost of one unit of j-th aliment E. Amaldi Foundations of Operations Research Politecnico di Milano 26

27 min n j= 1 c j x j (P) n j= 1 a ij x j b i i = 1,..., m x j 0 j = 1,...,n max m i= 1 b i y i (D) m i= 1 a ij y y i i c 0 j j = 1,..., n i = 1,...,m E. Amaldi Foundations of Operations Research Politecnico di Milano 27

28 Interpretation of the dual problem: A company that produces pills of the m nutrients needs to decide the nutrient unit prices y i so as to maximize income. If the costumer buys nutrient pills he will buy b i units for each i, 1 i m. The price of the nutrient pills must be competitive: m i= 1 aij yi c j j = 1,...,n cost of the pills that are equivalent to 1 unit of j-th aliment E. Amaldi Foundations of Operations Research Politecnico di Milano 28

29 If both linear programs (P) and (D) admit a feasible solution, the strong duality theorem implies that z * = w * An equilibrium exists (two alternatives with the same cost). Observation: Strong connection with Game theory (zero-sum games). E. Amaldi Foundations of Operations Research Politecnico di Milano 29

30 Optimality conditions Given min z = c T x (P) X Ax b x 0 (D) max w=b T y Y y T A c T y 0 two feasible solutions x * X and y * Y are optimal y * T b= c T x * If x j and y i are unknown, it is a single equation in n+m unknowns! E. Amaldi Foundations of Operations Research Politecnico di Milano 30

31 Since y *T b y *T Ax * c T x *, we have Ax * c T y *T b= y *T Ax * and y *T Ax * = c T x * therefore y *T (Ax * -b) = 0 and (c T -y *T A) x * = 0 0 T 0 0 T 0 m+n equations in n+m unknowns necessary and sufficient optimality conditions! E. Amaldi Foundations of Operations Research Politecnico di Milano 31

32 Complementary slackness conditions x * X and y * Y are optimal solutions of, respectively, (P) and (D) if and only if i-th row of A slack s i of i-th constraint of (P) y * i (a T i x * -b i ) = 0 i = 1,, m (c T j y *T A j ) x * j = 0 j = 1,, n slack of j-th constraint of (D) j-th column of A At optimality, the product of each variable with the corresponding slack variable of the relative dual is = 0. E. Amaldi Foundations of Operations Research Politecnico di Milano 32

33 Economic interpretation for the diet problem n a j1 ij x * j b i y * i 0 If the optimal diet includes an excess of i-th nutrient, the costumer is not willing to pay y * i > 0. y * i 0 n a j1 ij x * j b i If the company selects a price y * i > 0, the costumer must not have an excess of i-th nutrient. E. Amaldi Foundations of Operations Research Politecnico di Milano 33

34 m i1 y * i a ij c j x * j 0 it is not convenient for the costumer to buy aliment j price of the pills equivalent to the nutrients contained in one unit of j-th aliment is lower than the price of the aliment. x * j 0 m i1 y * i a ij c If costumer includes the j-th aliment in optimal diet, the company must have selected competitive prices y * i (the price of the nutrients in pills contained in a unit of j-th aliment is not lower than c j ). j E. Amaldi Foundations of Operations Research Politecnico di Milano 34

35 Example: (P) min 13x x 2 + 6x 3 s.t. 5x 1 + x 2 + 3x 3 = 8 3x 1 + x 2 = 3 x 1, x 2, x 3 0 (D) max 8y 1 + 3y 2 s.t. 5y 1 + 3y 2 13 y 1 + y y 1 6 Verify that the feasible x * = (1, 0, 1) is an optimal, non degenerate solution of (P). Suppose it is true and derives, via the complementary slackness conditions, the corresponding optimal solution of (D). E. Amaldi Foundations of Operations Research Politecnico di Milano 35

36 Since (P) is in standard form, the conditions y i * (a T i x * -b i ) = 0 are automatically satisfied i, 1 i 2. The condition (c T j y *T A j ) x * j = 0 is satisfied for j = 2 because x * 2= 0. Since x * 1 > 0 and x * 3 > 0, we obtain the conditions: 5y 1 + 3y 2 = 13 3y 1 = 6 and hence the optimal solution y * 1 = 2 and y * 2 = 1 of (D) with b T y * =19 = c T x *. E. Amaldi Foundations of Operations Research Politecnico di Milano 36

### Definition of a Linear Program

Definition of a Linear Program Definition: A function f(x 1, x,..., x n ) of x 1, x,..., x n is a linear function if and only if for some set of constants c 1, c,..., c n, f(x 1, x,..., x n ) = c 1 x 1

### . P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2

4. Basic feasible solutions and vertices of polyhedra Due to the fundamental theorem of Linear Programming, to solve any LP it suffices to consider the vertices (finitely many) of the polyhedron P of the

### AM 221: Advanced Optimization Spring Prof. Yaron Singer Lecture 7 February 19th, 2014

AM 22: Advanced Optimization Spring 204 Prof Yaron Singer Lecture 7 February 9th, 204 Overview In our previous lecture we saw the application of the strong duality theorem to game theory, and then saw

### Stanford University CS261: Optimization Handout 6 Luca Trevisan January 20, In which we introduce the theory of duality in linear programming.

Stanford University CS261: Optimization Handout 6 Luca Trevisan January 20, 2011 Lecture 6 In which we introduce the theory of duality in linear programming 1 The Dual of Linear Program Suppose that we

### max cx s.t. Ax c where the matrix A, cost vector c and right hand side b are given and x is a vector of variables. For this example we have x

Linear Programming Linear programming refers to problems stated as maximization or minimization of a linear function subject to constraints that are linear equalities and inequalities. Although the study

### 1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.

Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S

### Lecture 7 - Linear Programming

COMPSCI 530: Design and Analysis of Algorithms DATE: 09/17/2013 Lecturer: Debmalya Panigrahi Lecture 7 - Linear Programming Scribe: Hieu Bui 1 Overview In this lecture, we cover basics of linear programming,

### Outline. Linear Programming (LP): Simplex Search. Simplex: An Extreme-Point Search Algorithm. Basic Solutions

Outline Linear Programming (LP): Simplex Search Benoît Chachuat McMaster University Department of Chemical Engineering ChE 4G03: Optimization in Chemical Engineering 1 Basic Solutions

### LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS. 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method

LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method Introduction to dual linear program Given a constraint matrix A, right

### Lecture 4 Linear Programming Models: Standard Form. August 31, 2009

Linear Programming Models: Standard Form August 31, 2009 Outline: Lecture 4 Standard form LP Transforming the LP problem to standard form Basic solutions of standard LP problem Operations Research Methods

### Graphical method. plane. (for max) and down (for min) until it touches the set of feasible solutions. Graphical method

The graphical method of solving linear programming problems can be applied to models with two decision variables. This method consists of two steps (see also the first lecture): 1 Draw the set of feasible

### Duality in Linear Programming

Duality in Linear Programming 4 In the preceding chapter on sensitivity analysis, we saw that the shadow-price interpretation of the optimal simplex multipliers is a very useful concept. First, these shadow

### Min-cost flow problems and network simplex algorithm

Min-cost flow problems and network simplex algorithm The particular structure of some LP problems can be sometimes used for the design of solution techniques more efficient than the simplex algorithm.

### 5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition

### LINEAR PROGRAMMING P V Ram B. Sc., ACA, ACMA Hyderabad

LINEAR PROGRAMMING P V Ram B. Sc., ACA, ACMA 98481 85073 Hyderabad Page 1 of 19 Question: Explain LPP. Answer: Linear programming is a mathematical technique for determining the optimal allocation of resources

### Practical Guide to the Simplex Method of Linear Programming

Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear

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

IEOR 4404 Homework # Intro OR: Deterministic Models February 14, 011 Prof. Jay Sethuraman Page 1 of 5 Homework #.1 (a) What is the optimal solution of this problem? Let us consider that x 1, x and x 3

### By W.E. Diewert. July, Linear programming problems are important for a number of reasons:

APPLIED ECONOMICS By W.E. Diewert. July, 3. Chapter : Linear Programming. Introduction The theory of linear programming provides a good introduction to the study of constrained maximization (and minimization)

### 1. (a) Multiply by negative one to make the problem into a min: 170A 170B 172A 172B 172C Antonovics Foster Groves 80 88

Econ 172A, W2001: Final Examination, Possible Answers There were 480 possible points. The first question was worth 80 points (40,30,10); the second question was worth 60 points (10 points for the first

### Linear Programming: Chapter 5 Duality

Linear Programming: Chapter 5 Duality Robert J. Vanderbei October 17, 2007 Operations Research and Financial Engineering Princeton University Princeton, NJ 08544 http://www.princeton.edu/ rvdb Resource

### The Simplex Method. yyye

Yinyu Ye, MS&E, Stanford MS&E310 Lecture Note #05 1 The Simplex Method Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/

### 1 Polyhedra and Linear Programming

CS 598CSC: Combinatorial Optimization Lecture date: January 21, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im 1 Polyhedra and Linear Programming In this lecture, we will cover some basic material

### 3 Does the Simplex Algorithm Work?

Does the Simplex Algorithm Work? In this section we carefully examine the simplex algorithm introduced in the previous chapter. Our goal is to either prove that it works, or to determine those circumstances

### Optimization in R n Introduction

Optimization in R n Introduction Rudi Pendavingh Eindhoven Technical University Optimization in R n, lecture Rudi Pendavingh (TUE) Optimization in R n Introduction ORN / 4 Some optimization problems designing

### Geometry of Linear Programming

Chapter 2 Geometry of Linear Programming The intent of this chapter is to provide a geometric interpretation of linear programming problems. To conceive fundamental concepts and validity of different algorithms

### Simplex Method. Introduction:

Introduction: In the previous chapter, we discussed about the graphical method for solving linear programming problems. Although the graphical method is an invaluable aid to understand the properties of

### Quiz 1 Sample Questions IE406 Introduction to Mathematical Programming Dr. Ralphs

Quiz 1 Sample Questions IE406 Introduction to Mathematical Programming Dr. Ralphs These questions are from previous years and should you give you some idea of what to expect on Quiz 1. 1. Consider the

### Linear Inequalities and Linear Programming. Systems of Linear Inequalities in Two Variables

Linear Inequalities and Linear Programming 5.1 Systems of Linear Inequalities 5.2 Linear Programming Geometric Approach 5.3 Geometric Introduction to Simplex Method 5.4 Maximization with constraints 5.5

### Using the Simplex Method in Mixed Integer Linear Programming

Integer Using the Simplex Method in Mixed Integer UTFSM Nancy, 17 december 2015 Using the Simplex Method in Mixed Integer Outline Mathematical Programming Integer 1 Mathematical Programming Optimisation

### What is Linear Programming?

Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to

### Chapter 4. Duality. 4.1 A Graphical Example

Chapter 4 Duality Given any linear program, there is another related linear program called the dual. In this chapter, we will develop an understanding of the dual linear program. This understanding translates

### Chap 4 The Simplex Method

The Essence of the Simplex Method Recall the Wyndor problem Max Z = 3x 1 + 5x 2 S.T. x 1 4 2x 2 12 3x 1 + 2x 2 18 x 1, x 2 0 Chap 4 The Simplex Method 8 corner point solutions. 5 out of them are CPF solutions.

### Theory of Linear Programming

Theory of Linear Programming Debasis Mishra April 6, 2011 1 Introduction Optimization of a function f over a set S involves finding the maximum (minimum) value of f (objective function) in the set S (feasible

### Mathematical finance and linear programming (optimization)

Mathematical finance and linear programming (optimization) Geir Dahl September 15, 2009 1 Introduction The purpose of this short note is to explain how linear programming (LP) (=linear optimization) may

### Section Notes 3. The Simplex Algorithm. Applied Math 121. Week of February 14, 2011

Section Notes 3 The Simplex Algorithm Applied Math 121 Week of February 14, 2011 Goals for the week understand how to get from an LP to a simplex tableau. be familiar with reduced costs, optimal solutions,

### Chapter 3 LINEAR PROGRAMMING GRAPHICAL SOLUTION 3.1 SOLUTION METHODS 3.2 TERMINOLOGY

Chapter 3 LINEAR PROGRAMMING GRAPHICAL SOLUTION 3.1 SOLUTION METHODS Once the problem is formulated by setting appropriate objective function and constraints, the next step is to solve it. Solving LPP

### 1 Solving LPs: The Simplex Algorithm of George Dantzig

Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.

### Linear Programming is the branch of applied mathematics that deals with solving

Chapter 2 LINEAR PROGRAMMING PROBLEMS 2.1 Introduction Linear Programming is the branch of applied mathematics that deals with solving optimization problems of a particular functional form. A linear programming

### value is determined is called constraints. It can be either a linear equation or inequality.

Contents 1. Index 2. Introduction 3. Syntax 4. Explanation of Simplex Algorithm Index Objective function the function to be maximized or minimized is called objective function. E.g. max z = 2x + 3y Constraints

### Chapter 6. Linear Programming: The Simplex Method. Introduction to the Big M Method. Section 4 Maximization and Minimization with Problem Constraints

Chapter 6 Linear Programming: The Simplex Method Introduction to the Big M Method In this section, we will present a generalized version of the simplex method that t will solve both maximization i and

### Math 407A: Linear Optimization

Math 407A: Linear Optimization Lecture 4: LP Standard Form 1 1 Author: James Burke, University of Washington LPs in Standard Form Minimization maximization Linear equations to linear inequalities Lower

### Linear Programming Notes VII Sensitivity Analysis

Linear Programming Notes VII Sensitivity Analysis 1 Introduction When you use a mathematical model to describe reality you must make approximations. The world is more complicated than the kinds of optimization

### Chapter 15 Introduction to Linear Programming

Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of

### OPRE 6201 : 2. Simplex Method

OPRE 6201 : 2. Simplex Method 1 The Graphical Method: An Example Consider the following linear program: Max 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2

### The Simplex Method. What happens when we need more decision variables and more problem constraints?

The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving two decision variables and relatively few problem

### Linear Programming: Chapter 11 Game Theory

Linear Programming: Chapter 11 Game Theory Robert J. Vanderbei October 17, 2007 Operations Research and Financial Engineering Princeton University Princeton, NJ 08544 http://www.princeton.edu/ rvdb Rock-Paper-Scissors

### The Graphical Simplex Method: An Example

The Graphical Simplex Method: An Example Consider the following linear program: Max 4x 1 +3x Subject to: x 1 +3x 6 (1) 3x 1 +x 3 () x 5 (3) x 1 +x 4 (4) x 1, x 0. Goal: produce a pair of x 1 and x that

### Operation Research. Module 1. Module 2. Unit 1. Unit 2. Unit 3. Unit 1

Operation Research Module 1 Unit 1 1.1 Origin of Operations Research 1.2 Concept and Definition of OR 1.3 Characteristics of OR 1.4 Applications of OR 1.5 Phases of OR Unit 2 2.1 Introduction to Linear

### 56:171 Operations Research Midterm Exam Solutions Fall 2001

56:171 Operations Research Midterm Exam Solutions Fall 2001 True/False: Indicate by "+" or "o" whether each statement is "true" or "false", respectively: o_ 1. If a primal LP constraint is slack at the

### 56:171. Operations Research -- Sample Homework Assignments Fall 1992 Dennis Bricker Dept. of Industrial Engineering University of Iowa.

56:171 Operations Research -- Sample Homework Assignments Fall 1992 Dennis Bricker Dept. of Industrial Engineering University of Iowa Homework #1 (1.) Linear Programming Model Formulation. SunCo processes

### Introduction to Linear Programming.

Chapter 1 Introduction to Linear Programming. This chapter introduces notations, terminologies and formulations of linear programming. Examples will be given to show how real-life problems can be modeled

### 3. Linear Programming and Polyhedral Combinatorics

Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the

### Proximal mapping via network optimization

L. Vandenberghe EE236C (Spring 23-4) Proximal mapping via network optimization minimum cut and maximum flow problems parametric minimum cut problem application to proximal mapping Introduction this lecture:

### Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.

1. Introduction Linear Programming for Optimization Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1.1 Definition Linear programming is the name of a branch of applied mathematics that

### Basic solutions in standard form polyhedra

Recap, and outline of Lecture Previously min s.t. c x Ax = b x Converting any LP into standard form () Interpretation and visualization () Full row rank assumption on A () Basic solutions and bases in

### Linear Programming Notes V Problem Transformations

Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material

### Minimize subject to. x S R

Chapter 12 Lagrangian Relaxation This chapter is mostly inspired by Chapter 16 of [1]. In the previous chapters, we have succeeded to find efficient algorithms to solve several important problems such

### Sensitivity analysis for production planning model of an oil company

Sensitivity analysis for production planning model of an oil company Thesis Supervised by By Yu Da Assoc. Professor Tibor Illés Eötvös Loránd University Faculty of Natural Sciences 2004 ACKNOWLEDGEMENT

### Lecture 3: Linear Programming Relaxations and Rounding

Lecture 3: Linear Programming Relaxations and Rounding 1 Approximation Algorithms and Linear Relaxations For the time being, suppose we have a minimization problem. Many times, the problem at hand can

### LINEAR PROGRAMMING. A Concise Introduction. Thomas S. Ferguson

LINEAR PROGRAMMING A Concise Introduction Thomas S Ferguson Contents 1 Introduction 3 The Standard Maximum and Minimum Problems 4 The Diet Problem 5 The Transportation Problem 6 The Activity Analysis Problem

### Algebraic Simplex Method - Introduction Previous

Algebraic Simplex Method - Introduction To demonstrate the simplex method, consider the following linear programming model: This is the model for Leo Coco's problem presented in the demo, Graphical Method.

### 3. Evaluate the objective function at each vertex. Put the vertices into a table: Vertex P=3x+2y (0, 0) 0 min (0, 5) 10 (15, 0) 45 (12, 2) 40 Max

SOLUTION OF LINEAR PROGRAMMING PROBLEMS THEOREM 1 If a linear programming problem has a solution, then it must occur at a vertex, or corner point, of the feasible set, S, associated with the problem. Furthermore,

### Nonlinear Programming Methods.S2 Quadratic Programming

Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective

### Solving Linear Programs

Solving Linear Programs 2 In this chapter, we present a systematic procedure for solving linear programs. This procedure, called the simplex method, proceeds by moving from one feasible solution to another,

### 6. Mixed Integer Linear Programming

6. Mixed Integer Linear Programming Javier Larrosa Albert Oliveras Enric Rodríguez-Carbonell Problem Solving and Constraint Programming (RPAR) Session 6 p.1/40 Mixed Integer Linear Programming A mixed

### Equilibrium computation: Part 1

Equilibrium computation: Part 1 Nicola Gatti 1 Troels Bjerre Sorensen 2 1 Politecnico di Milano, Italy 2 Duke University, USA Nicola Gatti and Troels Bjerre Sørensen ( Politecnico di Milano, Italy, Equilibrium

### I. Solving Linear Programs by the Simplex Method

Optimization Methods Draft of August 26, 2005 I. Solving Linear Programs by the Simplex Method Robert Fourer Department of Industrial Engineering and Management Sciences Northwestern University Evanston,

### CHAPTER 17. Linear Programming: Simplex Method

CHAPTER 17 Linear Programming: Simplex Method CONTENTS 17.1 AN ALGEBRAIC OVERVIEW OF THE SIMPLEX METHOD Algebraic Properties of the Simplex Method Determining a Basic Solution Basic Feasible Solution 17.2

### Special Situations in the Simplex Algorithm

Special Situations in the Simplex Algorithm Degeneracy Consider the linear program: Maximize 2x 1 +x 2 Subject to: 4x 1 +3x 2 12 (1) 4x 1 +x 2 8 (2) 4x 1 +2x 2 8 (3) x 1, x 2 0. We will first apply the

### 18. Linear optimization

18. Linear optimization EE103 (Fall 2011-12) linear program examples geometrical interpretation extreme points simplex method 18-1 Linear program minimize c 1 x 1 +c 2 x 2 + +c n x n subject to a 11 x

### Solving Linear Programming Problem with Fuzzy Right Hand Sides: A Penalty Method

Solving Linear Programming Problem with Fuzzy Right Hand Sides: A Penalty Method S.H. Nasseri and Z. Alizadeh Department of Mathematics, University of Mazandaran, Babolsar, Iran Abstract Linear programming

### Linear Programming. March 14, 2014

Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1

### This exposition of linear programming

Linear Programming and the Simplex Method David Gale This exposition of linear programming and the simplex method is intended as a companion piece to the article in this issue on the life and work of George

### 7.4 Linear Programming: The Simplex Method

7.4 Linear Programming: The Simplex Method For linear programming problems with more than two variables, the graphical method is usually impossible, so the simplex method is used. Because the simplex method

### Linear Programming in Matrix Form

Linear Programming in Matrix Form Appendix B We first introduce matrix concepts in linear programming by developing a variation of the simplex method called the revised simplex method. This algorithm,

### Week 5 Integral Polyhedra

Week 5 Integral Polyhedra We have seen some examples 1 of linear programming formulation that are integral, meaning that every basic feasible solution is an integral vector. This week we develop a theory

### 2.3 Convex Constrained Optimization Problems

42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions

### Nonlinear Optimization: Algorithms 3: Interior-point methods

Nonlinear Optimization: Algorithms 3: Interior-point methods INSEAD, Spring 2006 Jean-Philippe Vert Ecole des Mines de Paris Jean-Philippe.Vert@mines.org Nonlinear optimization c 2006 Jean-Philippe Vert,

### 26 Linear Programming

The greatest flood has the soonest ebb; the sorest tempest the most sudden calm; the hottest love the coldest end; and from the deepest desire oftentimes ensues the deadliest hate. Th extremes of glory

### Linear Programming I

Linear Programming I November 30, 2003 1 Introduction In the VCR/guns/nuclear bombs/napkins/star wars/professors/butter/mice problem, the benevolent dictator, Bigus Piguinus, of south Antarctica penguins

### Linear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.

Linear Programming Widget Factory Example Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory:, Vertices, Existence of Solutions. Equivalent formulations.

### 3y 1 + 5y 2. y 1 + y 2 20 y 1 0, y 2 0.

1 Linear Programming A linear programming problem is the problem of maximizing (or minimizing) a linear function subject to linear constraints. The constraints may be equalities or inequalities. 1.1 Example

### Lecture notes 1: Introduction to linear and (mixed) integer programs

Lecture notes 1: Introduction to linear and (mixed) integer programs Vincent Conitzer 1 An example We will start with a simple example. Suppose we are in the business of selling reproductions of two different

### Solving Mixed Integer Linear Programs Using Branch and Cut Algorithm

1 Solving Mixed Integer Linear Programs Using Branch and Cut Algorithm by Shon Albert A Project Submitted to the Graduate Faculty of North Carolina State University in Partial Fulfillment of the Requirements

### The Equivalence of Linear Programs and Zero-Sum Games

The Equivalence of Linear Programs and Zero-Sum Games Ilan Adler, IEOR Dep, UC Berkeley adler@ieor.berkeley.edu Abstract In 1951, Dantzig showed the equivalence of linear programming problems and two-person

### Lecture 1: Linear Programming Models. Readings: Chapter 1; Chapter 2, Sections 1&2

Lecture 1: Linear Programming Models Readings: Chapter 1; Chapter 2, Sections 1&2 1 Optimization Problems Managers, planners, scientists, etc., are repeatedly faced with complex and dynamic systems which

### Duality in General Programs. Ryan Tibshirani Convex Optimization 10-725/36-725

Duality in General Programs Ryan Tibshirani Convex Optimization 10-725/36-725 1 Last time: duality in linear programs Given c R n, A R m n, b R m, G R r n, h R r : min x R n c T x max u R m, v R r b T

### Inverse Optimization by James Orlin

Inverse Optimization by James Orlin based on research that is joint with Ravi Ahuja Jeopardy 000 -- the Math Programming Edition The category is linear objective functions The answer: When you maximize

### Simplex method summary

Simplex method summary Problem: optimize a linear objective, subject to linear constraints 1. Step 1: Convert to standard form: variables on right-hand side, positive constant on left slack variables for

### Good luck, veel succes!

Final exam Advanced Linear Programming, May 7, 13.00-16.00 Switch off your mobile phone, PDA and any other mobile device and put it far away. No books or other reading materials are allowed. This exam

### Standard Form of a Linear Programming Problem

494 CHAPTER 9 LINEAR PROGRAMMING 9. THE SIMPLEX METHOD: MAXIMIZATION For linear programming problems involving two variables, the graphical solution method introduced in Section 9. is convenient. However,

### Linear Programming: Theory and Applications

Linear Programming: Theory and Applications Catherine Lewis May 11, 2008 1 Contents 1 Introduction to Linear Programming 3 1.1 What is a linear program?...................... 3 1.2 Assumptions.............................

### C&O 370 Deterministic OR Models Winter 2011

C&O 370 Deterministic OR Models Winter 2011 Assignment 1 Due date: Friday Jan. 21, 2011 Assignments are due at the start of class on the due date. Write your name and ID# clearly, and underline your last

### 0.1 Linear Programming

0.1 Linear Programming 0.1.1 Objectives By the end of this unit you will be able to: formulate simple linear programming problems in terms of an objective function to be maximized or minimized subject

### 9.4 THE SIMPLEX METHOD: MINIMIZATION

SECTION 9 THE SIMPLEX METHOD: MINIMIZATION 59 The accounting firm in Exercise raises its charge for an audit to \$5 What number of audits and tax returns will bring in a maximum revenue? In the simplex

### UNIT 2 MATRICES - I 2.0 INTRODUCTION. Structure

UNIT 2 MATRICES - I Matrices - I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress

### Sensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS

Sensitivity Analysis 3 We have already been introduced to sensitivity analysis in Chapter via the geometry of a simple example. We saw that the values of the decision variables and those of the slack and

### Linear Programming Sensitivity Analysis

Linear Programming Sensitivity Analysis Massachusetts Institute of Technology LP Sensitivity Analysis Slide 1 of 22 Sensitivity Analysis Rationale Shadow Prices Definition Use Sign Range of Validity Opportunity