4. Duality and Sensitivity
|
|
- Noreen Owen
- 6 years ago
- Views:
Transcription
1 4. Duality and Sensitivity For every instance of an LP, there is an associated LP known as the dual problem. The original problem is known as the primal problem. There are two de nitions of the dual pair of problems, which are equivalent. Duality can also be shown to be a `symmetric relationship (property of involution) in that the dual of the dual is the primal problem. 4. Primal Dual Formulations CANONICAL FORM P: Minimize c T x subject to Ax b x 0 D: Maximize y T b or b T y subject to y T A c T or A T y c y 0 STANDARD FORM P Minimize c T x subject to Ax = b x 0 D Maximize y T b or b T y subject to y T A c T (or A T y c) y free variables (u.r.s.) Note that if the number of variables in the primal problem is n and the number of constraints is m then the the number of variables in the dual problem is m and the number of constraints is n: In fact variables in the dual problem correspond to constraints in the primal problem and vice-versa. In other words, if xr n and A is (m n) then y R m and A T y c represents a system of n inequalities (the dual constraints) in m new unknown dual variables (y ; :::; y m ) : Example Primal:
2 Minimize 0x + x + 4x subject to x + x x 4x + x 0 x ; x ; x 0 Dual: Maximize y + 0y subject to y + 4y 0 y y + y 4 y ; y 0 Example Primal: Minimize 6x + 8x subject to x + x s = 4 x + x s = 7 x ; x ; s ; s 0 Dual: Maximize 4w + 7w subject to w + w 6 w + w 8 w ; w 0 The primal in this example is stated in standard form P. However the variables s ; s play the part of non-negative surplus variables since they do not appear in the objective function and it is easy to write down an equivalent primal problem in the canonical form P. The dual problem is the same, whether written in the form of D or as D. Economic interpretation of the dual
3 The dual of the diet problem introduced earlier min x s.t. c T x Ax r x 0 is max y s.t. y T b y T A c T y 0 We can provide an interesting economic interpretation of the dual in this case: Recall that a ij represents the amount of nutrient i contained in unit amount of the j th food. Consider a pill maker (an alternative supplier of nutrients) who wants to set a price for each nutrient. Let i be the price per unit of the i th nutrient (i = ; :::; m) forming a price vector. The pill maker s price to supply the required amount of each nutrient in the diet is mx i r i : i= The price of all nutrients needed to make up a unit amount of the j th food should be competitive, therefore not be more than the price of unit amount of the j th food. Hence mx i a ij c j i= j = ; :::; n Identifying y with we see that the dual problem maximizes the income of the pill maker subject to a competitiveness constraint. 4. Duality - basic properties 4.. Equivalence of dual forms The duality relationships P-D, P-D are equivalent. Proof We rst take the dual pair in standard form P-D as the de nition and nd the dual of a problem in the canonical form P: Minimize c T x subject to Ax b x 0
4 Introduce a vector of m surplus variables s 0 so the constraints can be written or Ax s = b x A I m = b s which is of the form A 0 x 0 = b where A 0 and x 0 are partitioned matrices. Applying the duality result for the primal in standard form P, the dual problem is Maximize subject to b T y A T I m y c 0 In this dual problem, although the D dual variables are not explicitly unrestricted in sign (free variables), the constraints imply that A T y c and y 0, which provides the dual problem D. We can also take the dual pair in canonical form P-D as the de nition and nd the dual of a problem in the canonical form P. (Exercise) 4.. Involution property The dual of the dual is the primal. Proof Consider the dual in canonical form D (yr m ; A(m n)) Maximize subject to b T y A T y c y 0 We may write this in the form of a canonical P primal problem Minimize subject to b T y A T y c y 0 The corresponding canonical dual problem in variables wr n is Maximize c T w subject to A T T w b T w 0 which is equivalent to the primal problem P Minimize subject to c T w Aw b w 0 4
5 4... Mixed Constraints The dual of LP problems that are neither in standard form nor in canonical form can be written down using rules summarized in the following table. Min Problem Max problem Type of Constraint Type of Variable a T i x b i y i 0 (P, D) a T i x b i y i 0 a T i x = b i y i u.r.s. (P, D) Type of Variable Type of Constraint x j 0 y T A j c j (either case) x j 0 y T A j c j x j u.r.s. y T A j = c j Notes:. u.r.s. denotes unrestricted in sign or free variable. a T i denotes i th primal constraint coe cients i.e. the i th row of A-matrix. A j denotes j th dual constraint coe cients i.e. the j th column of A-matrix Example (mixed constraints) Primal: Dual: Maximize z = x + 6x subject to x + x = x + x 4x + 7x 8 x u.r.s., x 0 Minimize w = y + y + 8y subject to y y + 4y = y + y + 7y 6 y u.r.s., y 0; y 0 Use of the Table: m = ; n = so dual has variables y ; y ; y and constraints Since primal is a maximization, refer to Table nd column for primal properties - read o dual properties from Table st column.
6 Variable x is u.r.s. )st dual constraint is = Variable x 0 ) nd dual constraint is (for minimization) st primal constraint is =, ) y is u.r.s. nd primal constraint is ) y 0 rd primal constraint is ) y 0 4. Duality Theorems The primal and dual LP problems are so intimately related that solving either problem provides the solution to the other. For the following results we assume the primal is a minimization in standard form P with dual D. 4.. Weak duality lemma If x, y are feasible for the primal and dual problems respectively, then) c T x y T b (4.) Proof Let x, y be feasible for problems P, D respectively. Then ) y T A c T (4.a) y T A c T 0 (4.b) y T A c T x 0 (4.c) (4.c) follows from (4.b) because x 0 (feasible for P) so P n i= y T A c T x i 0. i Now Ax = b; again because x is feasible for P, so y T Ax c T x 0 y T b c T x 0 y T b c T x as required. Corollary If x, y are feasible for P, D respectively and c T x = y T b then x and y are optimal for their respective problems. i.e. If a pair of feasible solutions for the primal and dual problems have the same objective function value, then they are optimal for their respective problems. 6
7 Corollary If either problem is unbounded (optimal solution is at in nity) the other problem in infeasible. [ NB The converse is not true as both problems can be infeasible ] Example In Example of Section 4. the primal and dual objective functions are z = 6x + 8x and w = 4y + 7y : It can easily be veri ed (e.g. graphically) that z min = w max = 4 x = 7 ; 0 T and y = 0; 6 T. and these optima are achieved at Let us solve the dual problem through simplex iterations. In standard form constraints are y + y + v = 6 y + y + v = 8 A basis of dual slacks is available: Max y y v 6 v 8 z After one pivot, the optimal tableau is y v z y v We may con rm the elements of the tableau as follows: B = 0 ; N = 0 B = 0 B N = = = (y ij ) 7
8 b = B b = 0 (z j c j ) = c T B y j c j = 6 8 ; 7 = 6 8 y v z 0 = c T B b = 7; = 4 The matrix form of the reduced tableau is Non-basic variables where z j c j are the elements of c T B B N c T N and z 0 = c T B b. Basic vars Y = B N = (y ij ) b z fz j c j g z 0 (4.) Simplex multipliers (dual variables) The components of the m-vector y T 0 = c T B B (4.4) known as simplex multipliers are the dual variables associated with a particular basis B: The dual vector is generally infeasible for the dual problem during intermediate tableau iterations. Only when the bottom row satis es primal optimality does y T 0 become dual feasible. We will show below that. the dual variables y 0 corresponding to an optimal basis are feasible. the dual objective w 0 = y T 0 b equals z 0, the minimum value of the primal. Therefore by Corollary to the weak duality lemma we have constructed an optimal dual vector y Strong duality theorem If either the primal or the dual has a nite optimal solution then so has the other and the corresponding objective function values are equal. If either problem is unbounded the other problem is infeasible. Proof Let y T 0 = c T B B where B is an optimal basis. y T 0 A = y T 0 h = h h c T B c T B i h i B N = c T BB B N i c T B B N (4.a) i = c T (4.b) c T N 8
9 so that y T 0 is dual feasible, with objective value w 0 = y T 0 b = c T BB b = c T Bx B = z 0 Notice that in going from (4.a) to (4.b) we have assumed that c T B B N c T N. This follows from the optimality conditions z j c j 0 8j, which are simply the components of c T B B N c T N. Example (continued) For the above example y T 0 = c T BB = 7; 0 = = x ; x 7 ; 0 : 0 Hence the primal optimal solution is x = 7 ; x = 0: 4.. Complementary slackness The complementary slackness (C-S) conditions, which are a consequence of duality, relate the values of the primal and dual vectors at a common optimum. They can be stated for either the asymmetric (P,D) or the symmetric (P D) primal dual pair. Theorem (Complementary slackness - asymmetric case) Let x; y be feasible for P, D respectively. A necessary and su cient condition (NSC) that they both be optimal is that for each j (j = ; :::; n) i) If x j > 0 then y T A j = c j ii) If y T A j < c j then x j = 0 Proof. Since x; y are feasible for their respective problems, we have Ax = b, x 0 y T A c T 9
10 Thus y T A + v T = c T with v T 0. Postmultiply by x and apply Ax = b y T Ax + v T x = c T x y T b + v T x = c T x c T x y T b = v T x (4.6) By corollary to the Weak Duality theorem, x; y are optimal if and only if r.h.s.= 0. Since v T x = P n j= v jx j with v j ; x j 0; r.h.s.= 0 if and only if v j x j = 0 for each j. So i) x j > 0 ) v j = 0 and ii) v j > 0 ) x j = 0 as required: [In fact ii) follows from i) and feasibility of y ] Theorem (Complementary slackness - symmetric case) Let x; y be feasible for P, D respectively. A necessary and su cient condition (NSC) that they both be optimal is that i) x j v j = 0 8j ii) s i y i = 0 8i where v j is the j th dual slack (corresponding to x j ) and s i is the i th primal slack so Comment: By analogy with the asymmetric case, we can write each equation as a pair of implications, 8j; x j > 0 ) v j = 0; v j > 0 ) x j = 0 (4.7a) 8i; s i > 0 ) y i = 0; y i > 0 ) s i = 0 (4.7b) Proof. Since x; y are feasible for their respective problems, we have Ax b, x 0 y T A c T, y 0 or, introducing slack variables s 0, v T 0 Ax s = b, x; s 0 y T A + v T = c T, y; v 0 Then y T Ax y T s = y T b y T Ax + v T x = c T x so c T x y T b = v T x + y T s (4.8) The result follows by analogy to the previous (asymmetric) case. 0
11 Example (continued) Recall the primal was Minimize 6x + 8x subject to x + x 4 x + x 7 x ; x 0 and the dual Maximize 4w + 7w The optimal solution to the primal is subject to w + w 6 (x ; x ; s ; s ) = w + w 8 w ; w 0 7 ; 0; ; 0 From the C-S conditions, the optimal solution to the dual takes the form (v ; v ; w ; w ) = (0; ; 0; ) i.e. the st dual variable is zero at the optimum (w = 0). Hence = 6 from the st dual constraint which is active (satis ed with equality) since v = 0: Hence (w ; w ) = 0; The Dual Simplex Algorithm Suppose we have a tableau that satis es the bottom row optimality conditions but which corresponds to an infeasible solution. i.e. we have non-basic variables x B Y =(y ij ) b z-row z j c j s z 0 with z j c j 0; each j (for minimization) and b i < 0 for some i. Such a tableau is said to be dual feasible because the associated dual vector y T 0 = c T B B satis es y T 0 A=y T 0 [BjN] c T The dual simplex algorithm is applicable. The rules for selecting a pivot element are:
12 . If b 0; stop; the current basis is optimal. Otherwise choose pivot row p by min i bi = b p (b p < 0). If y pj 0 8j stop; the problem is infeasible (because dual is unbounded). Otherwise, choose pivot column q by the minimum ratio rule z j min j y pj c j : y pj < 0 = z q c q y pq (4.9). Pivot on the element y pq (< 0) according to usual Simplex rules and return to Step. Notes i) The dual simplex algorthm is in fact the primal simplex algorithm applied to the dual problem. ii) The dual simplex algorithm can be useful (a) in avoiding a Phase I calculation when an infeasible but optimal tableau is available by inspection, (b) in sensitivity analysis when the current optimal solution becomes infeasible through the addition of an extra constraint or a small change in the right hand side vector b: in integer programming by Gomory s cutting planes. Example (Dual Simplex) Minimize x +x +4x subject to x +x + x x x +x 4 x ; x ; x 0 An initial (infeasible) tableau using s ; s as basic variables is After st dual simplex pivot x x x s s " After nd dual simplex pivot s x s x x 4 4 "
13 x x s s x Optimal solution is (x ; x ; x ; s ; s ) = ; ; 0; 0; 0 Optimal solution to dual (w; w) = 8 ; can be con rmed using C-S conditions (Ex.) N.B.. The OF value z is monotonic increasing in successive tableaux (min problem).. Since I m appears in the the initial A matrix and y T 0 = c T B B = c T B B ( I m ) w; w also appear negatively as the z j c j values for surplus variables s ; s. 4. Sensitivity Analysis,How is an optimal solution (of a LP in standard form) in uenced by. changes to the objective function coe cients c. changes to the rhs. of the constraints b. changes to the constraint matrix A; in particular (a) adding a new constraint a T m+x = b m+ (b) adding a new variable (or activity) x m+? From a knowledge of the simplex tableau at optimality non-basic variables x B Y =B N b = B b z-row c T B B N c T N z 0 = c T B B b (4.0) we see that. small changes to c a ect only the bottom row. small changes to b a ect only the rhs.. changes to A can potentially in uence all sections of the tableau (we will only consider in detail adding a new constraint)
14 Example (Furniture manufacturer) A manufacturer of furniture makes three products: desks, tables and chairs. Each item of furniture made consumes amounts of three resources: timber, nishing time and carpentry time. To manufacture one desk requires 8 ft. of timber, 4 hours nishing time and hours carpentry time A table requires 6 ft. of timber, hours nishing time and. hours carpentry time A chair requires ft. of timber,. hours nishing time and 0. hours carpentry time The total weekly availability of timber is 48 ft., of nishing time is 0 hrs and of carpentry time is 8 hrs. The unit pro t from selling a desk is $60, from a table is $0, from a chair is $0. The LP formulation to maximize the manufacturers pro t subject to the given resource constraints is as follows: Let x ; x ; x = no. of units of each product (desks, tables and chairs respectively) to make per week. Maximize 60x +0x +0x subject to 8x +6x + x 48 4x +x +:x 0 x +:x 0:x 8 x ; x ; x 0 resulting in the following tableaux Initial Tableau x x x s s 4 0 s Final Tableau s x s s 8 4 x 4 8 x The optimal solution is to manufacture desks and 8 chairs resulting in a pro t of $80. There is a surplus of 4 ft. of timber, but all available hours of nishing time, carpentry time are used up. Often the data assumed in the calculation are imprecise or subject to change. We now ask Q. What range of variation in unit pro t leaves the current solution optimal? Q. What is the optimal product mix if the unit pro t for a table increases to $40? Q. What if the total available nishing time increases to 0 hours? These questions can be answered through a sensitivity analysis. 4
15 . Changes to c From (4.0) we see these a ect the optimality conditions z j c j 0 (for max) each j, and the optimal value z 0 = c T Bb (though not of course the polytope representing the feasible region). Consider increasing a single component of c B ; say c by an amount, i.e. c nal tableau is c +: The modi ed s x s s 8 4 x 4 8 x The condition for the current solution to remain optimal is which need to be satis ed simultaneously. Hence or equivalently 6 c 80 For example, if c = 6 ( = 4) we nd an alternative optimal manufacturing plan is to stop manufacturing desks and instead to produce.6 tables and. desks per week s x s s 8 4 x 4 8 x s x s 6 s (7:) 6 x (:) 8 x (:6) NB Non-integer production values can still have meaning in a continuous production setting, although integer programming (IP) techniques (see Section ) will provide ways of nding optimal integer solutions. Similarly we can establish ranges for c and c (leaving the other components unchanged) that ensure the current solution remains optimal.. Suppose c = 40 ( = 0 in c ). As x is nonbasic in the optimal tableau, only that column s z j c j
16 value is changed. It becomes negative ( ) and after one pivot optimality is restored s x s s 8 4 x 4 8 x s x s 6 s (7:) 6 x (:) 8 x (:6) This is the same BFS as before.. Changes to b These a ect the rhs. of an optimal tableau (4.0). Consider an increase of to the second resource limitation b, b b + : We consider the e ect on b of the rhs. becoming b 0 = b + b with b = (0; ; 0) T e = (0; ; 0), the nd column of the identity matrix I : = e where b = B b b 0 = B (b + b) = b +B b = b +B e Notice that the product B e picks out the second column of B which appears in the nal tableau under s (which corresponded to e in the initial tableau). Hence The rhs. remains feasible while b = ; 8 + 0; 0 i.e. while 4 4 () 6 b 4 e.g. if b = 0 ( = 0) the nal tableau becomes infeasible. In this example feasibility (hence the optimal solution) is obtained after one iteration of the dual simplex algorithm s x s s 8 44 x 4 8 x s x x s x 6 s
F 1 F 2 Daily Requirement Cost N N N
Chapter 5 DUALITY 5. The Dual Problems Every linear programming problem has associated with it another linear programming problem and that the two problems have such a close relationship that whenever
More information4.6 Linear Programming duality
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
More informationMATHEMATICAL PROGRAMMING I
MATHEMATICAL PROGRAMMING I Books There is no single course text, but there are many useful books, some more mathematical, others written at a more applied level. A selection is as follows: Bazaraa, Jarvis
More informationPart 1. The Review of Linear Programming
In the name of God Part 1. The Review of Linear Programming 1.5. Spring 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Formulation of the Dual Problem Primal-Dual Relationship Economic Interpretation
More informationThe use of shadow price is an example of sensitivity analysis. Duality theory can be applied to do other kind of sensitivity analysis:
Sensitivity analysis The use of shadow price is an example of sensitivity analysis. Duality theory can be applied to do other kind of sensitivity analysis: Changing the coefficient of a nonbasic variable
More informationDuality Theory, Optimality Conditions
5.1 Duality Theory, Optimality Conditions Katta G. Murty, IOE 510, LP, U. Of Michigan, Ann Arbor We only consider single objective LPs here. Concept of duality not defined for multiobjective LPs. Every
More informationDeveloping an Algorithm for LP Preamble to Section 3 (Simplex Method)
Moving from BFS to BFS Developing an Algorithm for LP Preamble to Section (Simplex Method) We consider LP given in standard form and let x 0 be a BFS. Let B ; B ; :::; B m be the columns of A corresponding
More informationEND3033 Operations Research I Sensitivity Analysis & Duality. to accompany Operations Research: Applications and Algorithms Fatih Cavdur
END3033 Operations Research I Sensitivity Analysis & Duality to accompany Operations Research: Applications and Algorithms Fatih Cavdur Introduction Consider the following problem where x 1 and x 2 corresponds
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 5 Linear programming duality and sensitivity analysis
MVE165/MMG631 Linear and integer optimization with applications Lecture 5 Linear programming duality and sensitivity analysis Ann-Brith Strömberg 2017 03 29 Lecture 4 Linear and integer optimization with
More informationChapter 5 Linear Programming (LP)
Chapter 5 Linear Programming (LP) General constrained optimization problem: minimize f(x) subject to x R n is called the constraint set or feasible set. any point x is called a feasible point We consider
More informationChap6 Duality Theory and Sensitivity Analysis
Chap6 Duality Theory and Sensitivity Analysis The rationale of duality theory Max 4x 1 + x 2 + 5x 3 + 3x 4 S.T. x 1 x 2 x 3 + 3x 4 1 5x 1 + x 2 + 3x 3 + 8x 4 55 x 1 + 2x 2 + 3x 3 5x 4 3 x 1 ~x 4 0 If we
More informationReview Solutions, Exam 2, Operations Research
Review Solutions, Exam 2, Operations Research 1. Prove the weak duality theorem: For any x feasible for the primal and y feasible for the dual, then... HINT: Consider the quantity y T Ax. SOLUTION: To
More informationc) Place the Coefficients from all Equations into a Simplex Tableau, labeled above with variables indicating their respective columns
BUILDING A SIMPLEX TABLEAU AND PROPER PIVOT SELECTION Maximize : 15x + 25y + 18 z s. t. 2x+ 3y+ 4z 60 4x+ 4y+ 2z 100 8x+ 5y 80 x 0, y 0, z 0 a) Build Equations out of each of the constraints above by introducing
More informationSummary of the simplex method
MVE165/MMG630, The simplex method; degeneracy; unbounded solutions; infeasibility; starting solutions; duality; interpretation Ann-Brith Strömberg 2012 03 16 Summary of the simplex method Optimality condition:
More informationSensitivity Analysis and Duality
Sensitivity Analysis and Duality Part II Duality Based on Chapter 6 Introduction to Mathematical Programming: Operations Research, Volume 1 4th edition, by Wayne L. Winston and Munirpallam Venkataramanan
More informationLinear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004
Linear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004 1 In this section we lean about duality, which is another way to approach linear programming. In particular, we will see: How to define
More informationChapter 1 Linear Programming. Paragraph 5 Duality
Chapter 1 Linear Programming Paragraph 5 Duality What we did so far We developed the 2-Phase Simplex Algorithm: Hop (reasonably) from basic solution (bs) to bs until you find a basic feasible solution
More informationChapter 4 The Simplex Algorithm Part I
Chapter 4 The Simplex Algorithm Part I Based on Introduction to Mathematical Programming: Operations Research, Volume 1 4th edition, by Wayne L. Winston and Munirpallam Venkataramanan Lewis Ntaimo 1 Modeling
More informationSensitivity Analysis
Dr. Maddah ENMG 500 /9/07 Sensitivity Analysis Changes in the RHS (b) Consider an optimal LP solution. Suppose that the original RHS (b) is changed from b 0 to b new. In the following, we study the affect
More information21. Solve the LP given in Exercise 19 using the big-m method discussed in Exercise 20.
Extra Problems for Chapter 3. Linear Programming Methods 20. (Big-M Method) An alternative to the two-phase method of finding an initial basic feasible solution by minimizing the sum of the artificial
More informationNote 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)
Note 3: LP Duality If the primal problem (P) in the canonical form is min Z = n j=1 c j x j s.t. nj=1 a ij x j b i i = 1, 2,..., m (1) x j 0 j = 1, 2,..., n, then the dual problem (D) in the canonical
More informationStandard Form An LP is in standard form when: All variables are non-negativenegative All constraints are equalities Putting an LP formulation into sta
Chapter 4 Linear Programming: The Simplex Method An Overview of the Simplex Method Standard Form Tableau Form Setting Up the Initial Simplex Tableau Improving the Solution Calculating the Next Tableau
More informationFarkas Lemma, Dual Simplex and Sensitivity Analysis
Summer 2011 Optimization I Lecture 10 Farkas Lemma, Dual Simplex and Sensitivity Analysis 1 Farkas Lemma Theorem 1. Let A R m n, b R m. Then exactly one of the following two alternatives is true: (i) x
More informationUnderstanding the Simplex algorithm. Standard Optimization Problems.
Understanding the Simplex algorithm. Ma 162 Spring 2011 Ma 162 Spring 2011 February 28, 2011 Standard Optimization Problems. A standard maximization problem can be conveniently described in matrix form
More informationSection Notes 9. IP: Cutting Planes. Applied Math 121. Week of April 12, 2010
Section Notes 9 IP: Cutting Planes Applied Math 121 Week of April 12, 2010 Goals for the week understand what a strong formulations is. be familiar with the cutting planes algorithm and the types of cuts
More informationLinear Programming Inverse Projection Theory Chapter 3
1 Linear Programming Inverse Projection Theory Chapter 3 University of Chicago Booth School of Business Kipp Martin September 26, 2017 2 Where We Are Headed We want to solve problems with special structure!
More informationIntroduction to Mathematical Programming IE406. Lecture 10. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 10 Dr. Ted Ralphs IE406 Lecture 10 1 Reading for This Lecture Bertsimas 4.1-4.3 IE406 Lecture 10 2 Duality Theory: Motivation Consider the following
More informationOPERATIONS RESEARCH. Michał Kulej. Business Information Systems
OPERATIONS RESEARCH Michał Kulej Business Information Systems The development of the potential and academic programmes of Wrocław University of Technology Project co-financed by European Union within European
More informationIntroduction to Mathematical Programming
Introduction to Mathematical Programming Ming Zhong Lecture 22 October 22, 2018 Ming Zhong (JHU) AMS Fall 2018 1 / 16 Table of Contents 1 The Simplex Method, Part II Ming Zhong (JHU) AMS Fall 2018 2 /
More informationSensitivity Analysis and Duality in LP
Sensitivity Analysis and Duality in LP Xiaoxi Li EMS & IAS, Wuhan University Oct. 13th, 2016 (week vi) Operations Research (Li, X.) Sensitivity Analysis and Duality in LP Oct. 13th, 2016 (week vi) 1 /
More informationSlack 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
Simplex Method Slack Variable Max Z= 3x 1 + 4x 2 + 5X 3 Subject to: X 1 + X 2 + X 3 20 3x 1 + 4x 2 + X 3 15 2X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0 Standard Form Max Z= 3x 1 +4x 2 +5X 3 + 0S 1 + 0S 2
More informationDr. S. Bourazza Math-473 Jazan University Department of Mathematics
Dr. Said Bourazza Department of Mathematics Jazan University 1 P a g e Contents: Chapter 0: Modelization 3 Chapter1: Graphical Methods 7 Chapter2: Simplex method 13 Chapter3: Duality 36 Chapter4: Transportation
More informationLecture Note 18: Duality
MATH 5330: Computational Methods of Linear Algebra 1 The Dual Problems Lecture Note 18: Duality Xianyi Zeng Department of Mathematical Sciences, UTEP The concept duality, just like accuracy and stability,
More informationII. Analysis of Linear Programming Solutions
Optimization Methods Draft of August 26, 2005 II. Analysis of Linear Programming Solutions Robert Fourer Department of Industrial Engineering and Management Sciences Northwestern University Evanston, Illinois
More informationAM 121: Intro to Optimization Models and Methods
AM 121: Intro to Optimization Models and Methods Fall 2017 Lecture 2: Intro to LP, Linear algebra review. Yiling Chen SEAS Lecture 2: Lesson Plan What is an LP? Graphical and algebraic correspondence Problems
More information(P ) Minimize 4x 1 + 6x 2 + 5x 3 s.t. 2x 1 3x 3 3 3x 2 2x 3 6
The exam is three hours long and consists of 4 exercises. The exam is graded on a scale 0-25 points, and the points assigned to each question are indicated in parenthesis within the text. Problem 1 Consider
More informationTHE UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS. Operations Research I
LN/MATH2901/CKC/MS/2008-09 THE UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS Operations Research I Definition (Linear Programming) A linear programming (LP) problem is characterized by linear functions
More informationThe Simplex Method. Lecture 5 Standard and Canonical Forms and Setting up the Tableau. Lecture 5 Slide 1. FOMGT 353 Introduction to Management Science
The Simplex Method Lecture 5 Standard and Canonical Forms and Setting up the Tableau Lecture 5 Slide 1 The Simplex Method Formulate Constrained Maximization or Minimization Problem Convert to Standard
More informationSimplex Algorithm Using Canonical Tableaus
41 Simplex Algorithm Using Canonical Tableaus Consider LP in standard form: Min z = cx + α subject to Ax = b where A m n has rank m and α is a constant In tableau form we record it as below Original Tableau
More informationLectures 6, 7 and part of 8
Lectures 6, 7 and part of 8 Uriel Feige April 26, May 3, May 10, 2015 1 Linear programming duality 1.1 The diet problem revisited Recall the diet problem from Lecture 1. There are n foods, m nutrients,
More information1 Review Session. 1.1 Lecture 2
1 Review Session Note: The following lists give an overview of the material that was covered in the lectures and sections. Your TF will go through these lists. If anything is unclear or you have questions
More informationSEN301 OPERATIONS RESEARCH I LECTURE NOTES
SEN30 OPERATIONS RESEARCH I LECTURE NOTES SECTION II (208-209) Y. İlker Topcu, Ph.D. & Özgür Kabak, Ph.D. Acknowledgements: We would like to acknowledge Prof. W.L. Winston's "Operations Research: Applications
More information3. Duality: What is duality? Why does it matter? Sensitivity through duality.
1 Overview of lecture (10/5/10) 1. Review Simplex Method 2. Sensitivity Analysis: How does solution change as parameters change? How much is the optimal solution effected by changing A, b, or c? How much
More information9.1 Linear Programs in canonical form
9.1 Linear Programs in canonical form LP in standard form: max (LP) s.t. where b i R, i = 1,..., m z = j c jx j j a ijx j b i i = 1,..., m x j 0 j = 1,..., n But the Simplex method works only on systems
More informationThe Simplex Algorithm and Goal Programming
The Simplex Algorithm and Goal Programming In Chapter 3, we saw how to solve two-variable linear programming problems graphically. Unfortunately, most real-life LPs have many variables, so a method is
More informationSystems Analysis in Construction
Systems Analysis in Construction CB312 Construction & Building Engineering Department- AASTMT by A h m e d E l h a k e e m & M o h a m e d S a i e d 3. Linear Programming Optimization Simplex Method 135
More informationMarch 13, Duality 3
15.53 March 13, 27 Duality 3 There are concepts much more difficult to grasp than duality in linear programming. -- Jim Orlin The concept [of nonduality], often described in English as "nondualism," is
More informationAM 121: Intro to Optimization
AM 121: Intro to Optimization Models and Methods Lecture 6: Phase I, degeneracy, smallest subscript rule. Yiling Chen SEAS Lesson Plan Phase 1 (initialization) Degeneracy and cycling Smallest subscript
More informationRelation of Pure Minimum Cost Flow Model to Linear Programming
Appendix A Page 1 Relation of Pure Minimum Cost Flow Model to Linear Programming The Network Model The network pure minimum cost flow model has m nodes. The external flows given by the vector b with m
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 7: Duality and applications Prof. John Gunnar Carlsson September 29, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 29, 2010 1
More informationLinear Programming Duality
Summer 2011 Optimization I Lecture 8 1 Duality recap Linear Programming Duality We motivated the dual of a linear program by thinking about the best possible lower bound on the optimal value we can achieve
More informationPrelude to the Simplex Algorithm. The Algebraic Approach The search for extreme point solutions.
Prelude to the Simplex Algorithm The Algebraic Approach The search for extreme point solutions. 1 Linear Programming-1 x 2 12 8 (4,8) Max z = 6x 1 + 4x 2 Subj. to: x 1 + x 2
More informationLinear and Combinatorial Optimization
Linear and Combinatorial Optimization The dual of an LP-problem. Connections between primal and dual. Duality theorems and complementary slack. Philipp Birken (Ctr. for the Math. Sc.) Lecture 3: Duality
More informationLecture 2: The Simplex method
Lecture 2 1 Linear and Combinatorial Optimization Lecture 2: The Simplex method Basic solution. The Simplex method (standardform, b>0). 1. Repetition of basic solution. 2. One step in the Simplex algorithm.
More informationECE 307- Techniques for Engineering Decisions
ECE 307- Techniques for Engineering Decisions Lecture 4. Dualit Concepts in Linear Programming George Gross Department of Electrical and Computer Engineering Universit of Illinois at Urbana-Champaign DUALITY
More informationLinear Programming, Lecture 4
Linear Programming, Lecture 4 Corbett Redden October 3, 2016 Simplex Form Conventions Examples Simplex Method To run the simplex method, we start from a Linear Program (LP) in the following standard simplex
More information"SYMMETRIC" PRIMAL-DUAL PAIR
"SYMMETRIC" PRIMAL-DUAL PAIR PRIMAL Minimize cx DUAL Maximize y T b st Ax b st A T y c T x y Here c 1 n, x n 1, b m 1, A m n, y m 1, WITH THE PRIMAL IN STANDARD FORM... Minimize cx Maximize y T b st Ax
More informationmin 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
The exam is three hours long and consists of 4 exercises. The exam is graded on a scale 0-25 points, and the points assigned to each question are indicated in parenthesis within the text. If necessary,
More informationCSCI5654 (Linear Programming, Fall 2013) Lecture-8. Lecture 8 Slide# 1
CSCI5654 (Linear Programming, Fall 2013) Lecture-8 Lecture 8 Slide# 1 Today s Lecture 1. Recap of dual variables and strong duality. 2. Complementary Slackness Theorem. 3. Interpretation of dual variables.
More informationA Review of Linear Programming
A Review of Linear Programming Instructor: Farid Alizadeh IEOR 4600y Spring 2001 February 14, 2001 1 Overview In this note we review the basic properties of linear programming including the primal simplex
More informationMATH 373 Section A1. Final Exam. Dr. J. Bowman 17 December :00 17:00
MATH 373 Section A1 Final Exam Dr. J. Bowman 17 December 2018 14:00 17:00 Name (Last, First): Student ID: Email: @ualberta.ca Scrap paper is supplied. No notes or books are permitted. All electronic equipment,
More informationSpecial cases of linear programming
Special cases of linear programming Infeasible solution Multiple solution (infinitely many solution) Unbounded solution Degenerated solution Notes on the Simplex tableau 1. The intersection of any basic
More information4. 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
2 4. Duality of LPs and the duality theorem... 22 4.2 Complementary slackness... 23 4.3 The shortest path problem and its dual... 24 4.4 Farkas' Lemma... 25 4.5 Dual information in the tableau... 26 4.6
More informationIntroduction. Very efficient solution procedure: simplex method.
LINEAR PROGRAMMING Introduction Development of linear programming was among the most important scientific advances of mid 20th cent. Most common type of applications: allocate limited resources to competing
More information+ 5x 2. = x x. + x 2. Transform the original system into a system x 2 = x x 1. = x 1
University of California, Davis Department of Agricultural and Resource Economics ARE 5 Optimization with Economic Applications Lecture Notes Quirino Paris The Pivot Method for Solving Systems of Equations...................................
More informationLecture 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)
Lecture 10: Linear programming duality Michael Patriksson 19 February 2004 0-0 The dual of the LP in standard form minimize z = c T x (P) subject to Ax = b, x 0 n, and maximize w = b T y (D) subject to
More informationLecture 10: Linear programming duality and sensitivity 0-0
Lecture 10: Linear programming duality and sensitivity 0-0 The canonical primal dual pair 1 A R m n, b R m, and c R n maximize z = c T x (1) subject to Ax b, x 0 n and minimize w = b T y (2) subject to
More information56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker
56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker Answer all of Part One and two (of the four) problems of Part Two Problem: 1 2 3 4 5 6 7 8 TOTAL Possible: 16 12 20 10
More informationThe Dual Simplex Algorithm
p. 1 The Dual Simplex Algorithm Primal optimal (dual feasible) and primal feasible (dual optimal) bases The dual simplex tableau, dual optimality and the dual pivot rules Classical applications of linear
More informationCSCI 1951-G Optimization Methods in Finance Part 01: Linear Programming
CSCI 1951-G Optimization Methods in Finance Part 01: Linear Programming January 26, 2018 1 / 38 Liability/asset cash-flow matching problem Recall the formulation of the problem: max w c 1 + p 1 e 1 = 150
More informationΩ R n is called the constraint set or feasible set. x 1
1 Chapter 5 Linear Programming (LP) General constrained optimization problem: minimize subject to f(x) x Ω Ω R n is called the constraint set or feasible set. any point x Ω is called a feasible point We
More informationIntroduction to linear programming using LEGO.
Introduction to linear programming using LEGO. 1 The manufacturing problem. A manufacturer produces two pieces of furniture, tables and chairs. The production of the furniture requires the use of two different
More informationThe Graphical Method & Algebraic Technique for Solving LP s. Métodos Cuantitativos M. En C. Eduardo Bustos Farías 1
The Graphical Method & Algebraic Technique for Solving LP s Métodos Cuantitativos M. En C. Eduardo Bustos Farías The Graphical Method for Solving LP s If LP models have only two variables, they can be
More informationChapter 1: Linear Programming
Chapter 1: Linear Programming Math 368 c Copyright 2013 R Clark Robinson May 22, 2013 Chapter 1: Linear Programming 1 Max and Min For f : D R n R, f (D) = {f (x) : x D } is set of attainable values of
More informationCO350 Linear Programming Chapter 8: Degeneracy and Finite Termination
CO350 Linear Programming Chapter 8: Degeneracy and Finite Termination 27th June 2005 Chapter 8: Finite Termination 1 The perturbation method Recap max c T x (P ) s.t. Ax = b x 0 Assumption: B is a feasible
More informationAlgorithmic Game Theory and Applications. Lecture 7: The LP Duality Theorem
Algorithmic Game Theory and Applications Lecture 7: The LP Duality Theorem Kousha Etessami recall LP s in Primal Form 1 Maximize c 1 x 1 + c 2 x 2 +... + c n x n a 1,1 x 1 + a 1,2 x 2 +... + a 1,n x n
More informationOPERATIONS RESEARCH. Linear Programming Problem
OPERATIONS RESEARCH Chapter 1 Linear Programming Problem Prof. Bibhas C. Giri Department of Mathematics Jadavpur University Kolkata, India Email: bcgiri.jumath@gmail.com MODULE - 2: Simplex Method for
More informationOPTIMISATION 3: NOTES ON THE SIMPLEX ALGORITHM
OPTIMISATION 3: NOTES ON THE SIMPLEX ALGORITHM Abstract These notes give a summary of the essential ideas and results It is not a complete account; see Winston Chapters 4, 5 and 6 The conventions and notation
More informationUNIT-4 Chapter6 Linear Programming
UNIT-4 Chapter6 Linear Programming Linear Programming 6.1 Introduction Operations Research is a scientific approach to problem solving for executive management. It came into existence in England during
More informationReview Questions, Final Exam
Review Questions, Final Exam A few general questions 1. What does the Representation Theorem say (in linear programming)? 2. What is the Fundamental Theorem of Linear Programming? 3. What is the main idea
More informationmaxz = 3x 1 +4x 2 2x 1 +x 2 6 2x 1 +3x 2 9 x 1,x 2
ex-5.-5. Foundations of Operations Research Prof. E. Amaldi 5. Branch-and-Bound Given the integer linear program maxz = x +x x +x 6 x +x 9 x,x integer solve it via the Branch-and-Bound method (solving
More information1. Algebraic and geometric treatments Consider an LP problem in the standard form. x 0. Solutions to the system of linear equations
The Simplex Method Most textbooks in mathematical optimization, especially linear programming, deal with the simplex method. In this note we study the simplex method. It requires basically elementary linear
More informationMAT016: Optimization
MAT016: Optimization M.El Ghami e-mail: melghami@ii.uib.no URL: http://www.ii.uib.no/ melghami/ March 29, 2011 Outline for today The Simplex method in matrix notation Managing a production facility The
More informationThe Simplex Method. Formulate Constrained Maximization or Minimization Problem. Convert to Standard Form. Convert to Canonical Form
The Simplex Method 1 The Simplex Method Formulate Constrained Maximization or Minimization Problem Convert to Standard Form Convert to Canonical Form Set Up the Tableau and the Initial Basic Feasible Solution
More informationLecture 5. x 1,x 2,x 3 0 (1)
Computational Intractability Revised 2011/6/6 Lecture 5 Professor: David Avis Scribe:Ma Jiangbo, Atsuki Nagao 1 Duality The purpose of this lecture is to introduce duality, which is an important concept
More informationLecture 11: Post-Optimal Analysis. September 23, 2009
Lecture : Post-Optimal Analysis September 23, 2009 Today Lecture Dual-Simplex Algorithm Post-Optimal Analysis Chapters 4.4 and 4.5. IE 30/GE 330 Lecture Dual Simplex Method The dual simplex method will
More informationMath Models of OR: Sensitivity Analysis
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
More informationUNIVERSITY of LIMERICK
UNIVERSITY of LIMERICK OLLSCOIL LUIMNIGH Department of Mathematics & Statistics Faculty of Science and Engineering END OF SEMESTER ASSESSMENT PAPER MODULE CODE: MS4303 SEMESTER: Spring 2018 MODULE TITLE:
More informationIP 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.
IP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, 31 14. You wish to solve the IP below with a cutting plane technique. Maximize 4x 1 + 2x 2 + x 3 subject to 14x 1 + 10x 2 + 11x 3 32 10x 1 +
More informationThe dual simplex method with bounds
The dual simplex method with bounds Linear programming basis. Let a linear programming problem be given by min s.t. c T x Ax = b x R n, (P) where we assume A R m n to be full row rank (we will see in the
More informationOptimisation and Operations Research
Optimisation and Operations Research Lecture 9: Duality and Complementary Slackness Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/
More informationThe Simplex Algorithm
The Simplex Algorithm How to Convert an LP to Standard Form Before the simplex algorithm can be used to solve an LP, the LP must be converted into a problem where all the constraints are equations and
More informationmin3x 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.
ex-.-. Foundations of Operations Research Prof. E. Amaldi. Dual simplex algorithm Given the linear program minx + x + x x + x + x 6 x + x + x x, x, x. solve it via the dual simplex algorithm. Describe
More informationFoundations of Operations Research
Solved exercises for the course of Foundations of Operations Research Roberto Cordone The dual simplex method Given the following LP problem: maxz = 5x 1 +8x 2 x 1 +x 2 6 5x 1 +9x 2 45 x 1,x 2 0 1. solve
More informationPlanning and Optimization
Planning and Optimization C23. Linear & Integer Programming Malte Helmert and Gabriele Röger Universität Basel December 1, 2016 Examples Linear Program: Example Maximization Problem Example maximize 2x
More informationLinear Programming: Chapter 5 Duality
Linear Programming: Chapter 5 Duality Robert J. Vanderbei September 30, 2010 Slides last edited on October 5, 2010 Operations Research and Financial Engineering Princeton University Princeton, NJ 08544
More informationMidterm Review. Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.
Midterm Review Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye (LY, Chapter 1-4, Appendices) 1 Separating hyperplane
More informationThe Simplex Algorithm
8.433 Combinatorial Optimization The Simplex Algorithm October 6, 8 Lecturer: Santosh Vempala We proved the following: Lemma (Farkas). Let A R m n, b R m. Exactly one of the following conditions is true:.
More informationIntroduction to Mathematical Programming IE406. Lecture 13. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 13 Dr. Ted Ralphs IE406 Lecture 13 1 Reading for This Lecture Bertsimas Chapter 5 IE406 Lecture 13 2 Sensitivity Analysis In many real-world problems,
More informationLP Duality: outline. Duality theory for Linear Programming. alternatives. optimization I Idea: polyhedra
LP Duality: outline I Motivation and definition of a dual LP I Weak duality I Separating hyperplane theorem and theorems of the alternatives I Strong duality and complementary slackness I Using duality
More information