ECE 307- Techniques for Engineering Decisions
|
|
- Curtis Mosley
- 5 years ago
- Views:
Transcription
1 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
2 DUALITY Definition: A LP is in smmetric form if all the variables are restricted to be nonnegative and all the constraints are inequalities of the tpe: objective tpe max corresponding inequalit tpe min
3 DUALITY DEFINITIONS We first define the primal and dual problems max Z = c x st.. min W = b st.. Ax T x A b 0 T c 0 T ( P) ( D)
4 DUALITY DEFINITIONS The problems (P) and (D) are called the smmetric dual LP problems; we restate them as ( P )
5 DUALITY DEFINITIONS
6 EXAMPLE 1: MANUFACTURER TRANSPORTATION PROBLEM shipment cost coefficients R 1 retail stores warehouses R 1 R 2 R 3 W 1 W R 2 W 2 W R 3
7 EXAMPLE 1: MANUFACTURER TRANSPORTATION PROBLEM We are given that the supplies stored in warehouses W and W 1 2 satisf We are also given the demands needed to be met at the retail stores R, R, and R : 1 2 3
8 EXAMPLE 1: MANUFACTURER TRANSPORTATION PROBLEM The problem is to determine the least-cost shipping schedule We define the decision variable The shipping costs ma be viewed as
9 FORMULATION STATEMENT min Z = c x = 2x + 4x + 3x + 5x + 3x + 4x s.t. 2 3 i= 1 j= 1 ij ij x + x + x x + x + x x x 200 x x 300 x x 0 i = 1, 2, j = 1, 2, 3 ij + x 400
10 DUAL PROBLEM SETUP USING SYMMETRIC FORM 2 3 i= 1 j= 1 min Z = c x ij ij s.t x x x x x x x x x x x 0 i = 1,2 j= 1,2,3 ij x x
11 DUAL PROBLEM SETUP maxw = s.t c = c = c = c = c = c = i i = 1, 2,...,
12 THE DUAL PROBLEM INTERPRETATION The moving compan proposes to the manufacturer to: bu all the 300 units at W 1 at 1 / unit bu all the 600 units at W 2 at 2 / unit sell all the 200 units at R 1 at 3 / unit sell all the 300 units at R 2 at 4 / unit sell all the 400 units at R 3 at 5 / unit To convince the manufacturer to get the business, the mover ensures that the deliver fees cannot exceed the transportation costs the manufacturer would incur (the dual constraints)
13 THE DUAL PROBLEM INTERPRETATION + c = c = c = c = c = c = The mover wishes to maximize profits, i.e., revenues costs dual cost objective function maxw =
14 EXAMPLE 2: FURNITURE PRODUCTS Resource requirements item sales price ($) desks 60 tables 30 chairs 20 lumber board requirements finishing labor carpentr
15 EXAMPLE 2: FURNITURE PRODUCTS The Dakota Furniture Compan manufacturing: resource desk table chair available lumber board (ft ) finishing (h) carpentr (h) We assume that the demand for desks, tables and chairs is unlimited and the available resources are alread purchased The decision problem is to maximize total revenues
16 PRIMAL AND DUAL PROBLEM FORMULATION We define decision variables x = number of desks produced x 1 2 = number of tables produced x 3 = number of chairs produced The Dakota problem is max Z = 60x1 + 30x2 + 20x3 s.t. 1 8 x1 + 6 x2 + x3 48 lumber 2 4 x x x 3 20 finishing 3 2 x x x3 8 carpentr x,x,x
17 PRIMAL AND DUAL PROBLEM FORMULATION The dual problem is min W = s.t desk table chair 1 2 3,,
18 PRIMAL AND DUAL PROBLEM FORMULATION max Z = 60 x x x x 1+ 6 x 2 + x 3 48 lumber 2 4 x 1+ 2 x x 3 20 finishing 3 2 x x x 3 8 carpentr x, x,x 0 1 max W = desk table chair,,
19 INTERPRETATION OF THE DUAL PROBLEM An entrepreneur wishes to purchase all of Dakota s resources He needs, therefore, to determine the prices to pa for each unit of each resource = price paid for 1 lumber board ft 1 = price paid for 1 h of finishing labor 2 = price paid for 1 h of carpentr labor 3 We solve the Dakota dual problem to determine 1, 2 and 3
20 INTERPRETATION OF THE DUAL PROBLEM To induce Dakota to sell the raw resources, the resource prices must be set sufficientl high For example, the entrepreneur must offer Dakota at least $ 60 for a combination of resources that consists of 8 ft of lumber board, 4 h of finishing and 2 h of carpentr, since Dakota could use this combination to sell a desk for $ 60: this requirement implies the following dual constraint:
21 INTERPRETATION OF DUAL PROBLEM In the same wa, we obtain the two additional constraints for a table and for a chair The i th primal variable is associated with the i th constraint in the dual problem statement The j th dual variable is associated with the j th constraint in the primal problem statement
22 EXAMPLE 3: DIET PROBLEM A new diet requires that all food eaten come from one of the four basic food groups : chocolate cake ice cream soda cheesecake The four foods available for consumption are brownie chocolate ice cream cola pineapple cheesecake
23 EXAMPLE 3: DIET PROBLEM Minimum requirements for each da are: 500 cal 6 oz chocolate 10 oz sugar 8 oz fat The objective is to minimize the diet costs
24 EXAMPLE 3: DIET PROBLEM food calories chocolate (oz) sugar (oz) fat (oz) costs (cents) brownie chocolate ice cream (scoop) cola (bottle) pineapple cheesecake (piece)
25 PROBLEM FORMULATION Objective of the problem is to minimize the total costs of the diet Decision variables are defined for each da s purchases x x x x = number of brownies = number of chocolate ice cream scoops = number of bottles of soda = number of pineapple cheesecake pieces
26 PROBLEM FORMULATION The problem statement is min Z = 50 x + 20 x + 30 x + 80 x s.t x x x x 500 cal x + 2x 6 oz x + 2 x + 4 x + 4 x 10 oz x + 4 x + x + 5x 8 oz x 0 i = i 1,4
27 EXAMPLE 3: DIET PROBLEM The dual problem is max W = s.t ,,, brownie ice - cream soda cheesecake
28 We consider a salesperson of nutrients who is interested in assuming that each dieter meets dail requirements b purchasing calories, sugar, fat and chocolate as goods The decision is to determine the prices charged i INTERPRETATION OF THE DUAL = price per unit of required nutrient to sell to dieters Objective of the salesperson is to set the prices i so as to maximize revenues from selling to the dieter the dail ration of required nutrients
29 INTERPRETATION OF DUAL Now, the dieter can purchase a brownie for 50 and have 400 cal, 3 oz of chocolate, 2 oz of sugar and 2 oz of fat The sales price i must be set sufficientl low to entice the buer to get the required nutrients from the brownie: brownie constraint We derive similar constraints for the ice cream, the soda and the cheesecake
30 DUAL PROBLEMS T max Z = c x s.t. Ax b x 0 ( P) T min W = b s.t. T A c 0 ( D)
31 For an feasible for (P ) and an feasible for ( D ) WEAK DUALITY THEOREM x Proof: T T c x b T T T T T A c c A c x Ax T T T T c x Ax b = b
32 COROLLARY 1 OF THE WEAK DUALITY THEOREM T T x is feasible for P c x b ( ) for an feasible for D ( ) T T c x b = min W for an feasible x for P, T c x min W ( )
33 COROLLARY 2 OF THE WEAK DUALITY THEOREM T T is feasible for D c x b ( ) for ever feasible x for P ( ) T T T max Z max c x c x b = = for an feasible of D, T b max Z ( )
34 COROLLARIES 3 AND 4 OF THE WEAK DUALITY THEOREM If ( P ) is feasible and max Z is unbounded, i.e., Z +, then, ( D ) has no feasible solution. If ( D ) is feasible and min Z is unbounded, i.e., Z, then, ( P ) is infeasible.
35 DUALITY THEOREM APPLICATION Consider the maximization problem ( P)
36 DUALITY THEOREM APPLICATION The corresponding dual is given b min W = b T s.t. T A c ( D) 0 With the appropriate substitutions, we obtain
37 DUALITY THEOREM APPLICATION min W = s.t , 0 1 2
38 GENERALIZED FORM OF THE DUAL Consider the primal decision x = 1, i = 1, 2, 3,4 ; decision is feasible for (P) with i T Z = c x = 10 The dual decision i = 1, i = 1, 2 is feasible for (D) with T W = b = 40
39 DUALITY THEOREM APPLICATION Clearl, ( ) ( ) = 1 2 Z x,x,x,x = W, and so clearl, the feasible decision for (P) and (D) satisf the Weak Dualit Theorem Moreover, we have ( ) corollar 1 10 min W = W 1, 2 ( ) T corollar 2 max Z = Z x, x, x, x b = 40
40 COROLLARIES 5 AND 6 (P) is feasible and (D) is infeasible, then, (P) is unbounded (D) is feasible and (P) is infeasible, then, (D) is unbounded
41 EXAMPLE Consider the primal dual problems: st.. Now 1 2 x x x 2 ( P) max Z = x + x x 1+ x 2 x 3 1 x, x, x st.. x = 0 is feasible for ( P ) = min W , 2 0 ( D)
42 EXAMPLE but is impossible for (D) since it is inconsistent with 1, 2 0 Since (D) is infeasible, it follows from Corollar 5 that Z You are able to show this result b solving (P) using the simplex scheme
43 OPTIMALITY CRITERION THEOREM We consider the primal-dual problems (P) and (D) with x 0 is feasible for ( P) 0 is feasible for ( D) T 0 T 0 c x = b We next provide the proof: x 0 0 is feasible for ( P) is feasible for ( D) Weak Dualit Theorem T 0 T 0 c x b
44 OPTIMALITY CRITERION THEOREM but we are given that T 0 T 0 c x = b and so it follows that feasible x with 0 feasible 0 and so x is optimal ; T T 0 T 0 c x b = c x similarl, 0 feasible with x feasible and so it follows that T T 0 T 0 b c x = b 0 is optimal
45 MAIN DUALITY THEOREM (P) is feasible and (D) is feasible; then, x feasible for ( P) which is optimal and feasible for ( D) which is optimal such that T T c x = b
46 COMPLEMENTARY SLACKNESS CONDITIONS * * x and are optimal for (P) and (D), respectivel, if and onl if We prove this equivalence result b defining the slack variables and such that and are feasible; at the optimum, x
47 COMPLEMENTARY SLACKNESS CONDITIONS where the optimal values of the slack variables u and v depend on the optimal values x and Now,
48 COMPLEMENTARY SLACKNESS CONDITIONS This implies that We need to prove optimalit which is true if and onl if
49 COMPLEMENTARY SLACKNESS CONDITIONS However, x, are optimal Main Also, Dualit Theorem T T T T c x = b u + v x = 0 T T T T u v x 0 b c x + = = Optimalit Criterion Theorem x is optimal for ( P) and is optimal for ( D)
50 COMPLEMENTARY SLACKNESS CONDITIONS Note that x,, u, v > 0 component - wise each element 0 + = = = T u v x 0 i u i 0 i m At the optimum, and v x = 0 j = 1,..., n j j 1,..., and
51 COMPLEMENTARY SLACKNESS CONDITIONS Hence, for i = 1, 2,, m and Similarl for j = 1, 2,, n and m i = 1 n i i ij j j=1 > 0 b = a x m i ij i i j = 1 b a x > 0 = 0 m i ji i j i=1 x > 0 a = c a c > 0 x = 0 ji i j j
52 EXAMPLE max Z = x + 2x + 3x + 4x st.. x + 2 x + 2 x + 3 x ( P ) 2 x + x + 3 x + 2 x x 0 i = i 1,...,4
53 EXAMPLE min W = st ( D) , 0 1 2
54 EXAMPLE x, * * optimal ( ) * * * * * x x x x = ( ) * * * * * x x x x = * 1.2 = 0.2 is given as an optimal solution with min W = 28
55 EXAMPLE so that x + 2 x + 2 x + 3 x = 20 2 x + x + 3 x + 2 x = = > 1 x = = > 2 x = = = = = 4 2 x + 3 x = 20 x = x + 2 x = 20 x =
56 COMPLEMENTARY SLACKNESS CONDITION APPLICATIONS Ke uses of c.s. conditions are finding optimal (P) solution given optimal (D) solution and vice versa verification of optimalit of solution (whether a feasible solution is optimal) We can start with a feasible solution and attempt to construct an optimal dual solution; if we succeed, then the feasible primal solution is optimal
57 DUALITY T max Z = c x s.t. Ax b x 0 ( P) T min W = b s.t. T A c 0 ( D)
58 DUALITY Suppose the primal problem is minimization, then, T min Z = c x (P) s.t. Ax b x 0 T max W b (D) s.t. A T = c 0
59 INTERPRETATION The economic interpretation is * T * T * * Z max Z c x b W minw b i * i = = = = = constrained resource quantities, i = optimal dual variables Suppose, we change * bi bi + bi Z = i bi In words, the optimal dual variable for each primal constraint gives the net change in the optimal value of the objective function Z for a one unit change in the constraint on resources 1, 2,..., m
60 INTERPRETATION Economists refer to the dual variable as the shadow price on the constraint resource The shadow price determines the value/worth of having an additional quantit of a resource In the previous example, the optimal dual variables indicate that the worth of another unit of resource 1 is 1.2 while that of another unit of resource 2 is 0.2
61 GENERALIZED FORM OF THE DUAL We start out with T max Z = c x s.t. Ax = b ( P) x 0
62 GENERALIZED FORM OF THE DUAL To find ( D), we first put (P) in smmetric form Ax b Ax b x 0 A b x A b smmetric form
63 GENERALIZED FORM OF THE DUAL Let We rewrite the problem as st.. T min W b T A c is unsigned The c.s. conditions appl =
64 EXAMPLE 5: THE PRIMAL max Z = x x + x x st.. x + x + x + x = x x x 4 ( P) x x x x, x x, x unsigned
65 EXAMPLE 5: THE DUAL minw = st π x x + = 1 ( D) x + = x + 4 7,..., unsigned
66 EXAMPLE 5: c.s. conditions We are given that is optimal for (P) x 8 4 = 4 0 Then the c.s. conditions obtain ( ) x + = 0 * * *
67 so that EXAMPLE 5: c.s. conditions x = 8 > 0 + = The other c.s. conditions obtain 4 i a ij x j b i = 0 j = 1 Now, x 4 = 0 implies x 4 10 < 0 and so 7 = 0
68 EXAMPLE 5: c.s. conditions Also, * x 3 = 4 implies * 6 = 0 Similarl, the c.s. conditions 7 * * x j a ji i c j = 0 i= 1 have implications on the * i variable
69 EXAMPLE 5: c.s. conditions Since x * 2 = 4, then we have * 3 = 0 Now, with * 7 = 0 we have * 1 > 1 Since, W = T b we have = 1 * * 2 1
70 EXAMPLE 5 Suppose * 1 = 1 and so, * 2 = 0 Furthermore, implies + = 1 = 1 * * * * * 4 = 2
71 EXAMPLE 5 Also * * * = 1 implies 1 + = 1 * 5 and so * 5 = 0
72 EXAMPLE 5 Therefore ( *) ( 8)( 1) ( 8)( ) ( 4)( ) ( 4)( 2) W = ( 4)( 0) + ( 2)( 0) + ( 10)( 0) = 16 and so ( ) ( ) * * W = 16 = Z optimalit of P and D
73 PRIMAL DUAL TABLE primal (maximize) dual (minimize) A ( coefficient matrix ) A T ( transpose of the coefficient matrix ) b ( right-hand side vector ) b ( cost vector ) c ( price vector ) c ( right hand side vector ) i th constraint is = tpe the dual variable i is unrestricted in sign i th constraint is tpe the dual variable i 0 i th constraint is tpe the dual variable i 0 x j is unrestricted j th dual constraint is = tpe x j 0 j th dual constraint is tpe x j 0 j th dual constraint is tpe
END3033 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 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 informationChapter 3 Introduction to Linear Programming PART 1. Assoc. Prof. Dr. Arslan M. Örnek
Chapter 3 Introduction to Linear Programming PART 1 Assoc. Prof. Dr. Arslan M. Örnek http://homes.ieu.edu.tr/~aornek/ise203%20optimization%20i.htm 1 3.1 What Is a Linear Programming Problem? Linear Programming
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 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 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 informationLinear programming: Theory
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analsis and Economic Theor Winter 2018 Topic 28: Linear programming: Theor 28.1 The saddlepoint theorem for linear programming The
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 informationLinear Programming. Xi Chen. Department of Management Science and Engineering International Business School Beijing Foreign Studies University
Linear Programming Xi Chen Department of Management Science and Engineering International Business School Beijing Foreign Studies University Xi Chen (chenxi0109@bfsu.edu.cn) Linear Programming 1 / 148
More informationLinear Programming. Dr. Xiaosong DING
Linear Programming Dr. Xiaosong DING Department of Management Science and Engineering International Business School Beijing Foreign Studies University Dr. DING (xiaosong.ding@hotmail.com) Linear Programming
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 information4. Duality and Sensitivity
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
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 informationset CANDIDATE; set ZONE; param revenue{candidate, ZONE} >= 0; var Assign{CANDIDATE, ZONE} binary;
Assignment Problem Data Zone j = 1 2 3 4 5 6 Candidate i = 1 1 2 6 10 17 29 2 3 4 8 11 20 30 3 5 7 9 12 22 33 4 13 14 15 16 23 34 5 18 19 21 24 25 35 6 26 27 28 31 32 36 c ij = annual sales volume in $million
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 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 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 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 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 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 informationDuality in LPP Every LPP called the primal is associated with another LPP called dual. Either of the problems is primal with the other one as dual. The optimal solution of either problem reveals the information
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 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 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 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 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 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 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 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 informationLec12p1, ORF363/COS323. The idea behind duality. This lecture
Lec12 Page 1 Lec12p1, ORF363/COS323 This lecture Linear programming duality + robust linear programming Intuition behind the derivation of the dual Weak and strong duality theorems Max-flow=Min-cut Primal/dual
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 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 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 informationF 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 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 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 informationCOT 6936: Topics in Algorithms! Giri Narasimhan. ECS 254A / EC 2443; Phone: x3748
COT 6936: Topics in Algorithms! Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 giri@cs.fiu.edu https://moodle.cis.fiu.edu/v2.1/course/view.php?id=612 Gaussian Elimination! Solving a system of simultaneous
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 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 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 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 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 informationOperations Research. Duality in linear programming.
Operations Research Duality in linear programming Duality in linear programming As we have seen in past lessons, linear programming are either maximization or minimization type, containing m conditions
More informationIntroduction to LP. Types of Linear Programming. There are five common types of decisions in which LP may play a role
Linear Programming RK Jana Lecture Outline Introduction to Linear Programming (LP) Historical Perspective Model Formulation Graphical Solution Method Simplex Method Introduction to LP Continued Today many
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 informationOPERATIONS RESEARCH LECTURE NOTES
OPERATIONS RESEARCH LECTURE NOTES Y. İlker Topcu, Ph.D. Acknowledgements: We would like to acknowledge Prof. W.L. Winston's "Operations Research: Applications and Algorithms" and Prof. J.E. Beasley's lecture
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 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 informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Stud Guide for Test II Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Graph the linear inequalit. 1) 3 + -6 1) - - - - A) B) - - - - - - - -
More informationAM 121 Introduction to Optimization: Models and Methods Example Questions for Midterm 1
AM 121 Introduction to Optimization: Models and Methods Example Questions for Midterm 1 Prof. Yiling Chen Fall 2018 Here are some practice questions to help to prepare for the midterm. The midterm will
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 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 informationLINEAR PROGRAMMING MODULE Part 1 - Model Formulation INTRODUCTION
Name: LINEAR PROGRAMMING MODULE Part 1 - Model Formulation INTRODUCTION In general, a mathematical model is either deterministic or probabilistic. For example, the models and algorithms shown in the Graph-Optimization
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 informationAlgorithms and Theory of Computation. Lecture 13: Linear Programming (2)
Algorithms and Theory of Computation Lecture 13: Linear Programming (2) Xiaohui Bei MAS 714 September 25, 2018 Nanyang Technological University MAS 714 September 25, 2018 1 / 15 LP Duality Primal problem
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 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 informationNotes: Deterministic Models in Operations Research
Notes: Deterministic Models in Operations Research J.C. Chrispell Department of Mathematics Indiana University of Pennsylvania Indiana, PA, 15705, USA E-mail: john.chrispell@iup.edu http://www.math.iup.edu/~jchrispe
More informationSAMPLE QUESTIONS. b = (30, 20, 40, 10, 50) T, c = (650, 1000, 1350, 1600, 1900) T.
SAMPLE QUESTIONS. (a) We first set up some constant vectors for our constraints. Let b = (30, 0, 40, 0, 0) T, c = (60, 000, 30, 600, 900) T. Then we set up variables x ij, where i, j and i + j 6. By using
More informationMS-E2140. Lecture 1. (course book chapters )
Linear Programming MS-E2140 Motivations and background Lecture 1 (course book chapters 1.1-1.4) Linear programming problems and examples Problem manipulations and standard form Graphical representation
More informationHow to Take the Dual of a Linear Program
How to Take the Dual of a Linear Program Sébastien Lahaie January 12, 2015 This is a revised version of notes I wrote several years ago on taking the dual of a linear program (LP), with some bug and typo
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 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 informationAnother max flow application: baseball
CS124 Lecture 16 Spring 2018 Another max flow application: baseball Suppose there are n baseball teams, and team 1 is our favorite. It is the middle of baseball season, and some games have been played
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 informationChapter 2: Linear Programming Basics. (Bertsimas & Tsitsiklis, Chapter 1)
Chapter 2: Linear Programming Basics (Bertsimas & Tsitsiklis, Chapter 1) 33 Example of a Linear Program Remarks. minimize 2x 1 x 2 + 4x 3 subject to x 1 + x 2 + x 4 2 3x 2 x 3 = 5 x 3 + x 4 3 x 1 0 x 3
More informationMS-E2140. Lecture 1. (course book chapters )
Linear Programming MS-E2140 Motivations and background Lecture 1 (course book chapters 1.1-1.4) Linear programming problems and examples Problem manipulations and standard form problems Graphical representation
More informationSection 4.1 Solving Systems of Linear Inequalities
Section 4.1 Solving Systems of Linear Inequalities Question 1 How do you graph a linear inequality? Question 2 How do you graph a system of linear inequalities? Question 1 How do you graph a linear inequality?
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 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 informationExample Problem. Linear Program (standard form) CSCI5654 (Linear Programming, Fall 2013) Lecture-7. Duality
CSCI5654 (Linear Programming, Fall 013) Lecture-7 Duality Lecture 7 Slide# 1 Lecture 7 Slide# Linear Program (standard form) Example Problem maximize c 1 x 1 + + c n x n s.t. a j1 x 1 + + a jn x n b j
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 informationLINEAR PROGRAMMING II
LINEAR PROGRAMMING II LP duality strong duality theorem bonus proof of LP duality applications Lecture slides by Kevin Wayne Last updated on 7/25/17 11:09 AM LINEAR PROGRAMMING II LP duality Strong duality
More informationLinear Programming: The Simplex Method
7206 CH09 GGS /0/05 :5 PM Page 09 9 C H A P T E R Linear Programming: The Simplex Method TEACHING SUGGESTIONS Teaching Suggestion 9.: Meaning of Slack Variables. Slack variables have an important physical
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 informationLecture Notes 3: Duality
Algorithmic Methods 1/11/21 Professor: Yossi Azar Lecture Notes 3: Duality Scribe:Moran Bar-Gat 1 Introduction In this lecture we will present the dual concept, Farkas s Lema and their relation to the
More information2. Linear Programming Problem
. Linear Programming Problem. Introduction to Linear Programming Problem (LPP). When to apply LPP or Requirement for a LPP.3 General form of LPP. Assumptions in LPP. Applications of Linear Programming.6
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 informationMATH 445/545 Homework 1: Due February 11th, 2016
MATH 445/545 Homework 1: Due February 11th, 2016 Answer the following questions Please type your solutions and include the questions and all graphics if needed with the solution 1 A business executive
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 informationLinear Programming. H. R. Alvarez A., Ph. D. 1
Linear Programming H. R. Alvarez A., Ph. D. 1 Introduction It is a mathematical technique that allows the selection of the best course of action defining a program of feasible actions. The objective of
More informationStudy Unit 3 : Linear algebra
1 Study Unit 3 : Linear algebra Chapter 3 : Sections 3.1, 3.2.1, 3.2.5, 3.3 Study guide C.2, C.3 and C.4 Chapter 9 : Section 9.1 1. Two equations in two unknowns Algebraically Method 1: Elimination Step
More informationGraphical and Computer Methods
Chapter 7 Linear Programming Models: Graphical and Computer Methods Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna 2008 Prentice-Hall, Inc. Introduction Many management
More informationSystem Planning Lecture 7, F7: Optimization
System Planning 04 Lecture 7, F7: Optimization System Planning 04 Lecture 7, F7: Optimization Course goals Appendi A Content: Generally about optimization Formulate optimization problems Linear Programming
More informationOptimization, Part 2 (november to december): mandatory for QEM-IMAEF, and for MMEF or MAEF who have chosen it as an optional course.
Paris. Optimization, Part 2 (november to december): mandatory for QEM-IMAEF, and for MMEF or MAEF who have chosen it as an optional course. Philippe Bich (Paris 1 Panthéon-Sorbonne and PSE) Paris, 2016.
More informationAPPLIED ALGEBRA II SEMESTER 1 EXAM ITEM SPECIFICATION SHEET & KEY
APPLIED ALGEBRA II SEMESTER 1 EXAM ITEM SPECIFICATION SHEET & KEY Constructed Response # Objective Sllabus Objective NV State Standard 1 Graph a polnomial function. 1.1.7.1 Analze graphs of polnomial functions
More informationNotes: Deterministic Models in Operations Research
Notes: Deterministic Models in Operations Research J.C. Chrispell Department of Mathematics Indiana University of Pennsylvania Indiana, PA, 5705, USA E-mail: john.chrispell@iup.edu http://www.math.iup.edu/~jchrispe
More informationOptimisation. 3/10/2010 Tibor Illés Optimisation
Optimisation Lectures 3 & 4: Linear Programming Problem Formulation Different forms of problems, elements of the simplex algorithm and sensitivity analysis Lecturer: Tibor Illés tibor.illes@strath.ac.uk
More informationAn introductory example
CS1 Lecture 9 An introductory example Suppose that a company that produces three products wishes to decide the level of production of each so as to maximize profits. Let x 1 be the amount of Product 1
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 informationDeterministic Operations Research, ME 366Q and ORI 391 Chapter 2: Homework #2 Solutions
Deterministic Operations Research, ME 366Q and ORI 391 Chapter 2: Homework #2 Solutions 11. Consider the following linear program. Maximize z = 6x 1 + 3x 2 subject to x 1 + 2x 2 2x 1 + x 2 20 x 1 x 2 x
More informationDRAFT Formulation and Analysis of Linear Programs
DRAFT Formulation and Analysis of Linear Programs Benjamin Van Roy and Kahn Mason c Benjamin Van Roy and Kahn Mason September 26, 2005 1 2 Contents 1 Introduction 7 1.1 Linear Algebra..........................
More informationCPS 616 ITERATIVE IMPROVEMENTS 10-1
CPS 66 ITERATIVE IMPROVEMENTS 0 - APPROACH Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change
More informationLinear Programming. Formulating and solving large problems. H. R. Alvarez A., Ph. D. 1
Linear Programming Formulating and solving large problems http://academia.utp.ac.pa/humberto-alvarez H. R. Alvarez A., Ph. D. 1 Recalling some concepts As said, LP is concerned with the optimization of
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 informationAdvanced Linear Programming: The Exercises
Advanced Linear Programming: The Exercises The answers are sometimes not written out completely. 1.5 a) min c T x + d T y Ax + By b y = x (1) First reformulation, using z smallest number satisfying x z
More informationDiscrete Optimization
Prof. Friedrich Eisenbrand Martin Niemeier Due Date: April 15, 2010 Discussions: March 25, April 01 Discrete Optimization Spring 2010 s 3 You can hand in written solutions for up to two of the exercises
More informationLinear programming. Starch Proteins Vitamins Cost ($/kg) G G Nutrient content and cost per kg of food.
18.310 lecture notes September 2, 2013 Linear programming Lecturer: Michel Goemans 1 Basics Linear Programming deals with the problem of optimizing a linear objective function subject to linear equality
More informationTheory of Linear Programming
SCHOOL OF BUSINESS, ECONOMICS AND MANAGEMENT BF360 Operations Research Unit Two Theory of Linear Programming Moses Mwale e-mail: moses.mwale@ictar.ac.zm BF360 Operations Research Contents Unit 2: Theory
More informationSolution Cases: 1. Unique Optimal Solution Reddy Mikks Example Diet Problem
Solution Cases: 1. Unique Optimal Solution 2. Alternative Optimal Solutions 3. Infeasible solution Case 4. Unbounded Solution Case 5. Degenerate Optimal Solution Case 1. Unique Optimal Solution Reddy Mikks
More information