Linear Programming Inverse Projection Theory Chapter 3
|
|
- Joanna Gwenda Dean
- 5 years ago
- Views:
Transcription
1 1 Linear Programming Inverse Projection Theory Chapter 3 University of Chicago Booth School of Business Kipp Martin September 26, 2017
2 2 Where We Are Headed We want to solve problems with special structure! Real problems have special structure! One such structure is min c x + f y s.t. Ax + By b We learned how to project out the x variables. Later we will see how to do this and take advantage of special structure.
3 Where We Are Headed We want to solve problems with special structure! Real problems have special structure! Another example of special structure is min c x s.t. Ax b Bx d Objective, we are going to project out constraints and replace with variables.
4 Where We Are Headed So, the big picture is: Eliminate variables replace variables with constraints. This process yields multipliers that are the extreme rays and extreme points of the dual problem. Eliminate constraints replace constraints with variables. This process yields variables that correspond to the extreme points and extreme rays of the primal problem. Bottom line: depending on structure, replace constraints with variables or variables with constraints.
5 5 Special Structure Projection or inverse projection?
6 6 Special Structure Projection or inverse projection?
7 Outline Inverse Projection Finite Basis Theorem Fundamental Theorem of Linear Programming Solving Linear Programs with Inverse Projection Dual Relationships Sensitivity Analysis
8 8 Inverse Projection Consider the following system of inequalities: x x 1 x x 1 + x 2 3 x 1 x 2 6 x 1, x 2 0
9 9 Inverse Projection The geometry (we will come back to this) x 2 z 3 =7 4 z 5 =4 3 z 1 =2 Feasible Region z 6 =4 z 4 = x 1
10 Inverse Projection Let s transform the problem slightly: x 2 2x 0 x 3 = 0 0.5x 1 x 2 + 8x 0 x 4 = 0 0.5x 1 + x 2 + 3x 0 x 5 = 0 x 1 x 2 + 6x 0 x 6 = 0 x 0 = 1 x 1, x 2, x 0, x 3, x 4, x 5 x 6 0 What have I done? What would you do if there were variables that were unrestricted in sign?
11 11 Inverse Projection Eliminate the first constraint. Create a new variable for each combination of positive and negative coefficients. What does this remind you of? Where does the.5 come from? y 1 y 2 1 x x x 3 1 This leads to the variable transformation: x 2 = y 1 + y 2 x 0 = 0.5y 1 x 3 = y 2
12 Inverse Projection This transformation leads to the system (y 1 + y 2 ) y 1 y 2 = 0 0.5x 1 (y 1 + y 2 ) + 4y 1 x 4 = 0 0.5x 1 + (y 1 + y 2 ) + 1.5y 1 x 5 = 0 x 1 (y 1 + y 2 ) + 3y 1 x 6 = 0 0.5y 1 = 1 x 1, y 1, y 2, x 4, x 5 x 6 0 Why are the y variables nonnegative?
13 13 Inverse Projection Simplify and drop the 0 = 0 constraint. 0.5x 1 + 3y 1 y 2 x 4 = 0 0.5x y 1 + y 2 x 5 = 0 x 1 + 2y 1 y 2 x 6 = 0 0.5y 1 = 1 x 1, y 1, y 2, x 4, x 5, x 6 0 Why was the original system converted from inequalities to equalities?
14 Inverse Projection Now eliminate the constraint 0.5x 1 + 3y 1 y 2 x 4 = 0 through a variable transformation. v 1 v 2 v 3 v x y 1 1/3 1/3 1 y x The appropriate variable transformation is then x 1 = 2v 1 + 2v 2 y 1 = (1/3)v 3 +(1/3)v 4 y 2 = v 1 + v 3 x 4 = v 2 + v 4
15 Inverse Projection This transformation gives the system: v 2 + (11/6)v 3 + (5/6)v 4 x 5 = 0 v 1 + 2v 2 (1/3)v 3 + (2/3)v 4 x 6 = 0 (1/6)v 3 + (1/6)v 4 = 1 v 1, v 2, v 3, v 4, x 5, x 6 0 In terms of the original variables x 1 = 2v 1 + 2v 2 x 2 = v 1 + (4/3)v 3 + (1/3)v 4 x 0 = (1/6)v 3 + (1/6)v 4 x 3 = v 1 + v 3 x 4 = v 2 + v 4 x 5 = x 5 x 6 = x 6
16 Inverse Projection Next eliminate the constraint v 2 + (11/6)v 3 + (5/6)v 4 x 5 = 0 through a variable transformation. w 1 w 2 w 3 w 4 1 v (11/6) v 3 (6/11) (6/11) (5/6) v 4 (6/5) (6/5) 1 x The corresponding variable transformation is v 2 = w 1 + w 2 v 3 = (6/11)w 1 + (6/11)w 4 v 4 = (6/5)w 2 + (6/5)w 3 x 5 = w 3 + w 4
17 Inverse Projection This gives the system v 1 + (20/11)w 1 + (14/5)w 2 + (4/5)w 3 (2/11)w 4 x 6 = 0 (1/11)w 1 + (1/5)w 2 + (1/5)w 3 + (1/11)w 4 = 1 v 1, w 1, w 2, w 3, w 4, x 6 0 Transforming back to the original variables gives x 1 = 2v 1 + 2w 1 + 2w 2 x 2 = v 1 + (8/11)w 1 + (2/5)w 2 + (2/5)w 3 + (8/11)w 4 x 0 = (1/11)w 1 + (1/5)w 2 + (1/5)w 3 + (1/11)w 4 x 3 = v 1 + (6/11)w 1 + (6/11)w 4 x 4 = 1w 1 + (11/5)w 2 + (6/5)w 3 x 5 = w 3 + w 4 x 6 = x 6
18 Inverse Projection Observation: variable w 1 has five positive coefficients in the transformation matrix. Since only three constraints have been eliminated this means that w 1 is not necessary and can be dropped. Why? Refer back to Corollary 2.25 in Section 2.5 in Chapter 2 and note the analogy with dropping constraints when projecting out variables.
19 19 Inverse Projection Finally, eliminate the constraint v 1 + (14/5)w 2 + (4/5)w 3 (2/11)w 4 x 6 = 0 through a variable transformation. z 1 z 2 z 3 z 4 z 5 z 6 1 v /5 w 2 5/14 5/14 4/5 w 3 5/4 5/4 2/11 w 4 11/2 11/2 11/2 1 x The corresponding variable transformation is v 1 = z 1 +z 2 w 2 = (5/14)z 3 +(5/14)z 4 w 3 = (5/4)z 5 +(5/4)z 6 w 4 = (11/2)z 1 +(11/2)z 3 +(11/2)z 5 x 6 = z 2 +z 4 +z 6
20 20 Inverse Projection Substituting back gives (1/2)z 1 + (4/7)z 3 + (1/14)z 4 + (3/4)z 5 + (1/4)z 6 = 1 z 1, z 2, z 3, z 4, z 5, z 6 0 x 1 = 2z 1 +2z 2 +(5/7)z 3 +(5/7)z 4 x 2 = 5z 1 +z 2 +(29/7)z 3 +(1/7)z 4 +(9/2)z 5 +(1/2)z 6 x 0 = (1/2)z 1 +(4/7)z 3 +(1/14)z 4 +(3/4)z 5 +(1/4)z 6 x 3 = 4z 1 +z 2 +3z 3 +3z 5 x 4 = (11/14)z 3 +(11/14)z 4 +(3/2)z 5 + (3/2)z 6 x 5 = (11/2)z 1 +(11/2)z 3 (27/4)z 5 +(5/4)z 6 x 6 = z 2 +z 4 +z 6
21 21 Inverse Projection How do we get the extreme points? What about extreme rays? x 2 z 3 =7 4 z 5 =4 3 z 1 =2 Feasible Region z 6 =4 z 4 = x 1
22 Inverse Projection Exercise relate the extreme points of the picture to solutions of the system resulting from inverse projection.
23 Inverse Projection If we have the polyhedron x x 1 x x 1 + x 2 3 x 1 x 2 6 x 1, x 2 0 The underlying recession cone (which is a polyhedral cone) is x x 1 x x 1 + x 2 0 x 1 x 2 0 x 1, x 2 0
24 Inverse Projection What does this recession cone look like? x x 1 x x 1 + x 2 0 x 1 x 2 0 x 1, x 2 0 What is the relationship to the inverse projection problem?
25 25 Inverse Projection First, let s take the problem (1/2)z 1 + (4/7)z 3 + (1/14)z 4 + (3/4)z 5 + (1/4)z 6 = 1 drop z 3 (why), make the substitution z 1, z 2, z 3, z 4, z 5, z 6 0 z 1 = 2λ 1, z 2 = λ 2, z 4 = 14λ 4, z 5 = 4 3 λ 5, z 6 = 4λ 6 and rewrite as λ 1 + λ 4 + λ 5 + λ 6 = 1 λ 1, λ 2, λ 4, λ 5, λ 6 0
26 26 Inverse Projection Let s find points in the polyhedron. x 1 = 4λ 1 + 2λ λ 4 x 2 = 10λ 1 + 1λ 2 + 2λ 4 + 6λ 5 + 2λ 6 λ 1 + λ 4 + λ 5 + λ 6 = 1 λ 1, λ 2, λ 4, λ 5, λ 6 0 If x 1 = 2 and x 2 = 4, what is the corresponding value of λ? Try λ 2 = 1, λ 5 = 1/4 and λ 6 = 3/4. What did I do in terms of geometry?
27 Inverse Projection Oh no! I just thought of something new to worry about! There is no end to it. Worry! Worry! Worry! We just showed that if x 1 = 2 and x 2 = 4, then there is a corresponding value of λ. But here is what worries me. How do we know we can get very point in the polyhedron? (Recall my worries about the projection cone.)
28 Inverse Projection Is it really true that P = {x Ax = b, x 0} = conv({x 1,..., x q })+cone({x q+1,..., x r }) where each x i for i = 1,..., r corresponds to a λ i? When we did projection, a key result is that projection yields all of the extreme points and extreme rays of the dual polyhedron. We need a similar result for inverse projection!
29 Inverse Projection Here is another way to look at the problem. The original problem is: min c x Ax = b x 0 The transformed problem (x = Tz and T 0) that we solve is: min c Tz ATz = b z 0 What do we need to prove?
30 Inverse Projection My worries really boil down to, is the following: I can clearly see that if we are given a z then we have a corresponding x = T z that is feasible for the original linear program. But here is where I start to get nervous: given an x feasible to my original system, how do I know there is a corresponding z that makes the new system feasible and satisfies x = T z? So many worries, so little time.
31 31 Inverse Projection Proposition 3.2: If P = {(x, x 0 ) R n+1 Ax bx 0 = 0, x 0 = 1, x 0} then (x, x 0 ) P if and only if there is a y such that (x, x 0, y) is feasible to the transformed system. Let s go the hard way and show if we are given a point x in P then there is always a feasible solution to the transformed system. It is sufficient to show that this is the case for projecting out one constraint. Why?
32 Inverse Projection In general, we construct the transformation as follows: (see picture on next page) x 0 = x i = n 2 j=1 n 2 j=1 y 0j /( b 1 ). y ij /a 1i, i = 1,..., n 1, n 1 x n1 +j = y ij /a 1,n1 +j, j = 1,..., n 2. i=0 Note: without loss, b 1 < 0.
33 33 Inverse Projection Apply inverse projection to the system Ax bx 0 = 0, x 0 = 1, x 0. -b 1 x y y 0n2 y 02 a 11 x 1 1 y 11 y 12 n 1 +1 a 1,n1 +1 x n 1 +1 y 1n2 y 21 a 12 x y 22 y 1n2 y n11 y n1 2 n n 1 +n 2 a 1,n1 +2 x n 1 +2 a 1,n1 +n 2 x n 1 +n 2 y n1 n 2 a 1n1 x n 1 n 1
34 34 Inverse Projection A key part of the proof: If (x, x 0 ) is feasible to P how can you find a y so that (x, x 0, y) is feasible to the lifted system?
35 35 Inverse Projection Example: Assume the constraint to project out is 5x 1 + 3x 2 x 3 2x 4 + 4x 0 = 0. The transformation matrix is y 03 y 04 y 13 y 14 y 23 y x x x x x What does the corresponding network look like?
36 36 Inverse Projection Solve a transportation problem! For a given x, supply equals demand! -b 1 x y y 0n2 y 02 a 11 x 1 1 y 11 y 12 n 1 +1 a 1,n1 +1 x n 1 +1 y 1n2 y 21 a 12 x y 22 y 1n2 y n11 y n1 2 n n 1 +n 2 a 1,n1 +2 x n 1 +2 a 1,n1 +n 2 x n 1 +n 2 y n1 n 2 a 1n1 x n 1 n 1
37 Finite Basis Theorem Summary: We have taken a polyhedron P = {x R n Ax b, x 0} and replaced it with P = {(x, y, x 0 ) R n R m R Ax Iy bx 0 = 0, x 0, y 0, x 0 = 1} where P = proj x (P ).
38 Finite Basis Theorem We applied inverse projection to P to get Ax Iy bx 0 = 0, x 0 = 1, x 0 where d 1 z d q z q = 1 (1) z 1,..., z q, z q+1..., z r 0 (2) x y x 0 = Tz. (3) Why does this do it for us? 38
39 39 Finite Basis Theorem Let x 1,..., x r denote the columns of T in (3) after scaling by 1/d i for i = 1,..., r. Then (1) - (3) implies (x, y, x 0 ) P if and only if x y x 0 = q r z i x i + z i x i (4) i=1 i=q+1 where q i z i = 1, z i 0, i = 1,..., q.
40 Finite Basis Theorem The result expressed in (4) is a finite basis theorem. The finite set of vectors {x 1,..., x r } are a finite basis for the polyhedron P This result for polyhedra is known as the Minkowski finite basis theorem. Thus a polyhedron can be expressed either as the intersection of a finite number of linear inequalities or in finite basis form.
41 Finite Basis Theorem Here is another way to think about the Minkowski finite basis theorem. The finite basis theorem says that any polyhedron, P, can be expressed as P = conv({x 1,..., x q }) + cone({x q+1,..., x r }). In other words a polyhedron is the Minkowski sum of a polytope and a cone. What do we mean by the Minkowski sum of two sets?
42 Finite Basis Theorem In the case of a polyhedral cone C = {x R n Ax 0} the finite basis theorem says C = cone({x q+1,..., x r }). Thus we have the nice duality that a polyhedral cone is finitely generated and (by Weyl) a finitely generate cone is a polyhedral cone.
43 Finite Basis Theorem A few comments. 1. Since P = proj x (P ) the finite basis theorem applies to any polyhedron of the form P = {x R n Ax b}. 2. We can assume, without loss, that the points in the set {x 1,..., x q } are extreme points of P the points in the set {x q+1,..., x r } are the extreme rays of the recession cone {x R n Ax 0, }. 3. When A is a rational matrix and b is a rational vector, then {x 1,..., x r } are rational vectors. Why?
44 Fundamental Theorem of Linear Program Theorem 3.4: If the linear program min {c x Ax = b, x 0 } has an optimal solution, then there is an optimal extreme point solution to this linear program. If there is not an optimal solution, then the linear program is either unbounded or infeasible. By the way, how does the simplex algorithm work?
45 45 Fundamental Theorem of Linear Program Proof: The fundamental theorem of linear programming is a simple consequence of the finite basis theorem. If P = {x Ax = b, x 0 } is not empty then there are x 1,..., x q, x q+1,..., x r in R n such that P = conv({x 1,..., x q }) + cone({x q+1,..., x r }). Without loss, assume the set {x 1,..., x q } is minimal with respect to taking subsets. Then each x 1,..., x q is an extreme point of P. If x P then, x = r z i x i, i=1 q z i = 1, z i 0, i = 1,..., r. i=1
46 46 Fundamental Theorem of Linear Program Proof (continued): If x is an optimal solution to the linear program, then c x i 0 for i = q + 1,..., r. Why? The optimality of x implies z i = 0 if c x i > 0 for i = q + 1,..., r. Why? Then any x i for which z i > 0, i = 1,..., q is an optimal solution. Why?
47 Solving Linear Programs Use inverse projection to solve min{c x Ax b}. Consider the linear program min 2x 1 3x 2 x x 1 x x 1 + x 2 3 x 1 x 2 6 x 1, x 2 0 Forget the objective function! Do inverse projection on the constraints.
48 48 Solving Linear Programs Inverse projection on the constraints gave (1/2)z 1 + (4/7)z 3 + (1/14)z 4 + (3/4)z 5 + (1/4)z 6 = 1 z 1, z 2, z 3, z 4, z 5, z 6 0 x 1 = 2z 1 +2z 2 +(5/7)z 3 +(5/7)z 4 x 2 = 5z 1 +z 2 +(29/7)z 3 +(1/7)z 4 +(9/2)z 5 +(1/2)z 6 x 0 = (1/2)z 1 +(4/7)z 3 +(1/14)z 4 +(3/4)z 5 +(1/4)z 6 x 3 = 4z 1 +z 2 +3z 3 +3z 5 x 4 = (11/14)z 3 +(11/14)z 4 +(3/2)z 5 + (3/2)z 6 x 5 = (11/2)z 1 +(11/2)z 3 (27/4)z 5 +(5/4)z 6 x 6 = z 2 +z 4 +z 6
49 49 Solving Linear Programs Transform the objective function by c x c Tz = 11z 1 + z 2 11z 3 + z 4 (27/2)z 5 (3/2)z 6 where T is the transformation matrix. What are the components of T?
50 50 Solving Linear Programs The transformed problem is min 11z 1 + z 2 11z 3 + z 4 (27/2)z 5 (3/2)z 6 (1/2)z 1 + (4/7)z 3 + (1/14)z 4 + (3/4)z 5 + (1/4)z 6 = 1 z 1, z 2, z 3, z 4, z 5, z 6 0
51 Solving Linear Programs So the problem is: min 11z 1 + z 2 11z 3 + z 4 (27/2)z 5 (3/2)z 6 (1/2)z 1 + (4/7)z 3 + (1/14)z 4 + (3/4)z 5 + (1/4)z 6 = 1 How can you tell if this is unbounded? Solve by finding the best bang-for-buck ratio. z 1, z 2, z 3, z 4, z 5, z (1/2) = 22, 11 (4/7) = 19.25, 1 (1/14) = 14, (27/2) (3/4) = 18, (3/2) (1/4) = 6. Therefore the optimal solution is z 1 = 2 which corresponds to an optimal x 1 = 4, x 2 = 10. The optimal objective function value is 22.
52 Dual Relationships Consider the following primal-dual pair min 2x 1 3x 2 x x 1 x x 1 + x 2 3 x 1 x 2 6 x 1, x 2 0 max 2u 1 8u 2 3u 3 6u 4 0.5u 2 0.5u 3 + u 4 2 u 1 u 2 + u 3 u 4 3 u 1, u 2, u 3, u 4 0.
53 Dual Relationships Solve the dual with projection 2u 1 + 8u 2 + 3u 3 + 6u 4 + z 0 0 (E0) 0.5u 2 0.5u 3 + u 4 2 (E1) u 1 u 2 + u 3 u 4 3 (E2) u 1 0 (E3) u 2 0 (E4) u 3 0 (E5) u 4 0 (E6) Project out u 1 6u 2 + 5u 3 + 4u 4 + z 0 6 (E0) + 2(E2) u 2 + u 3 u 4 3 (E2) + (E3) 0.5u 2 0.5u 3 + u 4 2 (E1) u 2 0 (E4) u 3 0 (E5) u 4 0 (E6)
54 Dual Relationships 6u 2 + 5u 3 + 4u 4 + z 0 6 (E0) + 2(E2) u 2 + u 3 u 4 3 (E2) + (E3) 0.5u 2 0.5u 3 + u 4 2 (E1) u 2 0 (E4) u 3 0 (E5) u 4 0 (E6) Let y 1 and y 2 be dual variables associated with the first two rows, x 1 associated with equation (E1) and x 4, x 5, x 6 associated with (E4), (E5), and (E6), respectively. The objective function is max z 0. Then the dual problem is: min + 2x 1 6y 1 3y 2 0.5x 1 + 6y 1 y 2 x 4 = 0 0.5x 1 + 5y 1 + y 2 x 5 = 0 x 1 + 4y 1 y 2 x 6 = 0 y 1 = 1 x 1, y 1, y 2, x 4, x 5, x 6 0
55 Primal-Dual Relationships Summary What did we just do? Took the dual of our primal problem Projected out a variable of the dual Took the dual of the projected problem Observed the resulting primal was equal to eliminating a constraint in the primal If I project out all of the variables in the dual what do the multipliers give me?
56 56 Primal-Dual Relationships Summary Getting stuck: How can you get stuck with inverse projection? What would you do when you get stuck?
57 Primal-Dual Relationships Summary One more time! Eliminate variables replace variables with constraints. This process yields multipliers that are the extreme rays and extreme points of the dual problem. Eliminate constraints replace constraints with variables. This process yields the extreme points and extreme rays of the primal problem.
58 58 Sensitivity Analysis The result of inverse projection on the linear program is (1/2)z 1 + (4/7)z 3 + (1/14)z 4 + (3/4)z 5 + (1/4)z 6 = 1 z 1, z 2, z 3, z 4, z 5, z 6 0 x 1 = 2z 1 +2z 2 +(5/7)z 3 +(5/7)z 4 x 2 = 5z 1 +z 2 +(29/7)z 3 +(1/7)z 4 +(9/2)z 5 +(1/2)z 6 x 0 = (1/2)z 1 +(4/7)z 3 +(1/14)z 4 +(3/4)z 5 +(1/4)z 6 x 3 = 4z 1 +z 2 +3z 3 +3z 5 x 4 = (11/14)z 3 +(11/14)z 4 +(3/2)z 5 + (3/2)z 6 x 5 = (11/2)z 1 +(11/2)z 3 (27/4)z 5 +(5/4)z 6 x 6 = z 2 +z 4 +z 6
59 Sensitivity Analysis Let c 1 be the objective function coefficient on variable x 1 and c 2 the objective function coefficient on variable x 2. If z 0 is the optimal objective function value then Or, z 0 = min {c Tz i 4c c 2, (5/4)c 1 + (29/4)c 2 10c 1 + 2c 2, 0c 1 + 6c 2, 0c 1 + 2c 2 }. z 0 4c c 2 z 0 (5/4)c 1 + (29/4)c 2 z 0 10c 1 + 2c 2 z 0 0c 1 + 6c 2 z 0 0c 1 + 2c 2 and z 0 is maximized.
60 Sensitivity Analysis Consider the linear program we have been working with but with the objective function coefficient of x 1 now 5. MIN 5 X1-3 X2 SUBJECT TO 2) X2 >= 2 3) 0.5 X1 - X2 >= - 8 4) X1 + X2 >= - 3 5) X1 - X2 >= - 6 END
61 Sensitivity Analysis LP OPTIMUM FOUND AT STEP 2 OBJECTIVE VALUE = VARIABLE VALUE REDUCED COST X X ROW SLACK OR SURPLUS DUAL PRICE
62 Sensitivity Analysis RANGES IN WHICH THE BASIS IS UNCHANGED: OBJ COEFFICIENT RANGES VARIABLE CURRENT ALLOWABLE ALLOWABLE COEF INCREASE DECREASE X INFINITY X RIGHTHAND SIDE RANGES ROW CURRENT ALLOWABLE ALLOWABLE RHS INCREASE DECREASE INFINITY INFINITY INFINITY
63 Sensitivity Analysis Some definitions: Allowable increase (decrease) on an objective function coefficient for variable x i is the maximum increase (decrease) on c i such that the current optimal primal solution remans an optimal solution. Increasing (decreasing) a coefficient by its allowable increase decrease introduces alternative primal optima. The reduced cost on a variable is zero if the variable is currently positive in an optimal solution. If the variable is at zero, then the reduced cost on the variable is equal to its allowable decrease (minimization).
64 Sensitivity Analysis Assume that the linear program min{c Ax b, x 0} has an optimal primal-dual solution (x, u, w) where u is the optimal dual vector for Ax b and w is the optimal dual vector on the x 0. Alternative definition: the reduced cost on variable x j is w j. Note that w j is equal to c j u A j where A j is column j of A. For homework you will explore the relationship between these definitions.
65 Sensitivity Analysis Questions: Why is 2 the allowable decrease the objective function coefficient of x 1? Why is 3 the allowable increase the objective function coefficient of x 2? Why is 2 the reduced cost on x 1? See htmls/coursework/36900/datafiles/obj_sensitivity.xlsx
Introduction 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 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 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 informationChapter 1. Preliminaries
Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between
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 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 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 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 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 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 informationLinear programs, convex polyhedra, extreme points
MVE165/MMG631 Extreme points of convex polyhedra; reformulations; basic feasible solutions; the simplex method Ann-Brith Strömberg 2015 03 27 Linear programs, convex polyhedra, extreme points A linear
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 informationDuality and Projections
Duality and Projections What s the use? thst@man.dtu.dk DTU-Management Technical University of Denmark 1 Outline Projections revisited... Farka s lemma Proposition 2.22 and 2.23 Duality theory (2.6) Complementary
More informationMAT-INF4110/MAT-INF9110 Mathematical optimization
MAT-INF4110/MAT-INF9110 Mathematical optimization Geir Dahl August 20, 2013 Convexity Part IV Chapter 4 Representation of convex sets different representations of convex sets, boundary polyhedra and polytopes:
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.433: Combinatorial Optimization Michel X. Goemans February 28th, 2013 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
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 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 informationOptimization WS 13/14:, by Y. Goldstein/K. Reinert, 9. Dezember 2013, 16: Linear programming. Optimization Problems
Optimization WS 13/14:, by Y. Goldstein/K. Reinert, 9. Dezember 2013, 16:38 2001 Linear programming Optimization Problems General optimization problem max{z(x) f j (x) 0,x D} or min{z(x) f j (x) 0,x D}
More informationCO 250 Final Exam Guide
Spring 2017 CO 250 Final Exam Guide TABLE OF CONTENTS richardwu.ca CO 250 Final Exam Guide Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4,
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 information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans April 5, 2017 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
More informationWeek 3 Linear programming duality
Week 3 Linear programming duality This week we cover the fascinating topic of linear programming duality. We will learn that every minimization program has associated a maximization program that has the
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 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 information56:171 Operations Research Fall 1998
56:171 Operations Research Fall 1998 Quiz Solutions D.L.Bricker Dept of Mechanical & Industrial Engineering University of Iowa 56:171 Operations Research Quiz
More informationLecture 7 Duality II
L. Vandenberghe EE236A (Fall 2013-14) Lecture 7 Duality II sensitivity analysis two-person zero-sum games circuit interpretation 7 1 Sensitivity analysis purpose: extract from the solution of an LP information
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 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 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 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 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 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 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 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 informationInteger Programming, Part 1
Integer Programming, Part 1 Rudi Pendavingh Technische Universiteit Eindhoven May 18, 2016 Rudi Pendavingh (TU/e) Integer Programming, Part 1 May 18, 2016 1 / 37 Linear Inequalities and Polyhedra Farkas
More informationLagrangian Relaxation in MIP
Lagrangian Relaxation in MIP Bernard Gendron May 28, 2016 Master Class on Decomposition, CPAIOR2016, Banff, Canada CIRRELT and Département d informatique et de recherche opérationnelle, Université de Montréal,
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 informationMotivating examples Introduction to algorithms Simplex algorithm. On a particular example General algorithm. Duality An application to game theory
Instructor: Shengyu Zhang 1 LP Motivating examples Introduction to algorithms Simplex algorithm On a particular example General algorithm Duality An application to game theory 2 Example 1: profit maximization
More informationLP Relaxations of Mixed Integer Programs
LP Relaxations of Mixed Integer Programs John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA February 2015 Mitchell LP Relaxations 1 / 29 LP Relaxations LP relaxations We want
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 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 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 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 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 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 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 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 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 informationLinear programming. Saad Mneimneh. maximize x 1 + x 2 subject to 4x 1 x 2 8 2x 1 + x x 1 2x 2 2
Linear programming Saad Mneimneh 1 Introduction Consider the following problem: x 1 + x x 1 x 8 x 1 + x 10 5x 1 x x 1, x 0 The feasible solution is a point (x 1, x ) that lies within the region defined
More informationLecture 9: Dantzig-Wolfe Decomposition
Lecture 9: Dantzig-Wolfe Decomposition (3 units) Outline Dantzig-Wolfe decomposition Column generation algorithm Relation to Lagrangian dual Branch-and-price method Generated assignment problem and multi-commodity
More informationIntroduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Module - 03 Simplex Algorithm Lecture 15 Infeasibility In this class, we
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 informationOPRE 6201 : 3. Special Cases
OPRE 6201 : 3. Special Cases 1 Initialization: The Big-M Formulation Consider the linear program: Minimize 4x 1 +x 2 3x 1 +x 2 = 3 (1) 4x 1 +3x 2 6 (2) x 1 +2x 2 3 (3) x 1, x 2 0. Notice that there are
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 informationLinear Programming. Chapter Introduction
Chapter 3 Linear Programming Linear programs (LP) play an important role in the theory and practice of optimization problems. Many COPs can directly be formulated as LPs. Furthermore, LPs are invaluable
More informationORIE 6300 Mathematical Programming I August 25, Lecture 2
ORIE 6300 Mathematical Programming I August 25, 2016 Lecturer: Damek Davis Lecture 2 Scribe: Johan Bjorck Last time, we considered the dual of linear programs in our basic form: max(c T x : Ax b). We also
More informationEE364a Review Session 5
EE364a Review Session 5 EE364a Review announcements: homeworks 1 and 2 graded homework 4 solutions (check solution to additional problem 1) scpd phone-in office hours: tuesdays 6-7pm (650-723-1156) 1 Complementary
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 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 information56:171 Operations Research Midterm Exam--15 October 2002
Name 56:171 Operations Research Midterm Exam--15 October 2002 Possible Score 1. True/False 25 _ 2. LP sensitivity analysis 25 _ 3. Transportation problem 15 _ 4. LP tableaux 15 _ Total 80 _ Part I: True(+)
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 informationSection Notes 8. Integer Programming II. Applied Math 121. Week of April 5, expand your knowledge of big M s and logical constraints.
Section Notes 8 Integer Programming II Applied Math 121 Week of April 5, 2010 Goals for the week understand IP relaxations be able to determine the relative strength of formulations understand the branch
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 informationDistributed Real-Time Control Systems. Lecture Distributed Control Linear Programming
Distributed Real-Time Control Systems Lecture 13-14 Distributed Control Linear Programming 1 Linear Programs Optimize a linear function subject to a set of linear (affine) constraints. Many problems can
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 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 informationDuality of LPs and Applications
Lecture 6 Duality of LPs and Applications Last lecture we introduced duality of linear programs. We saw how to form duals, and proved both the weak and strong duality theorems. In this lecture we will
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 informationLinear and Integer Optimization (V3C1/F4C1)
Linear and Integer Optimization (V3C1/F4C1) Lecture notes Ulrich Brenner Research Institute for Discrete Mathematics, University of Bonn Winter term 2016/2017 March 8, 2017 12:02 1 Preface Continuous updates
More informationKey Things We Learned Last Time. IE418 Integer Programming. Proving Facets Way #2 Indirect. A More Abstract Example
Key Things We Learned Last Time IE48: Integer Programming Department of Industrial and Systems Engineering Lehigh University 8th March 5 A face F is said to be a facet of P if dim(f ) = dim(p ). All facets
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 3 Simplex Method for Bounded Variables We discuss the simplex algorithm
More informationSummary of the simplex method
MVE165/MMG631,Linear and integer optimization with applications The simplex method: degeneracy; unbounded solutions; starting solutions; infeasibility; alternative optimal solutions Ann-Brith Strömberg
More information36106 Managerial Decision Modeling Linear Decision Models: Part II
1 36106 Managerial Decision Modeling Linear Decision Models: Part II Kipp Martin University of Chicago Booth School of Business January 20, 2014 Reading and Excel Files Reading (Powell and Baker): Sections
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 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 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 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 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 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. Larry Blume Cornell University, IHS Vienna and SFI. Summer 2016
Linear Programming Larry Blume Cornell University, IHS Vienna and SFI Summer 2016 These notes derive basic results in finite-dimensional linear programming using tools of convex analysis. Most sources
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 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 informationLinear Programming and the Simplex method
Linear Programming and the Simplex method Harald Enzinger, Michael Rath Signal Processing and Speech Communication Laboratory Jan 9, 2012 Harald Enzinger, Michael Rath Jan 9, 2012 page 1/37 Outline Introduction
More informationBrief summary of linear programming and duality: Consider the linear program in standard form. (P ) min z = cx. x 0. (D) max yb. z = c B x B + c N x N
Brief summary of linear programming and duality: Consider the linear program in standard form (P ) min z = cx s.t. Ax = b x 0 where A R m n, c R 1 n, x R n 1, b R m 1,and its dual (D) max yb s.t. ya c.
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 informationCSC373: Algorithm Design, Analysis and Complexity Fall 2017 DENIS PANKRATOV NOVEMBER 1, 2017
CSC373: Algorithm Design, Analysis and Complexity Fall 2017 DENIS PANKRATOV NOVEMBER 1, 2017 Linear Function f: R n R is linear if it can be written as f x = a T x for some a R n Example: f x 1, x 2 =
More informationFundamentals of Operations Research. Prof. G. Srinivasan. Indian Institute of Technology Madras. Lecture No. # 15
Fundamentals of Operations Research Prof. G. Srinivasan Indian Institute of Technology Madras Lecture No. # 15 Transportation Problem - Other Issues Assignment Problem - Introduction In the last lecture
More informationAN INTRODUCTION TO CONVEXITY
AN INTRODUCTION TO CONVEXITY GEIR DAHL NOVEMBER 2010 University of Oslo, Centre of Mathematics for Applications, P.O.Box 1053, Blindern, 0316 Oslo, Norway (geird@math.uio.no) Contents 1 The basic concepts
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 informationDuality in Linear Programming
Duality in Linear Programming Gary D. Knott Civilized Software Inc. 1219 Heritage Park Circle Silver Spring MD 296 phone:31-962-3711 email:knott@civilized.com URL:www.civilized.com May 1, 213.1 Duality
More information1 Simplex and Matrices
1 Simplex and Matrices We will begin with a review of matrix multiplication. A matrix is simply an array of numbers. If a given array has m rows and n columns, then it is called an m n (or m-by-n) matrix.
More informationOPTIMISATION 2007/8 EXAM PREPARATION GUIDELINES
General: OPTIMISATION 2007/8 EXAM PREPARATION GUIDELINES This points out some important directions for your revision. The exam is fully based on what was taught in class: lecture notes, handouts and homework.
More informationThe Primal-Dual Algorithm P&S Chapter 5 Last Revised October 30, 2006
The Primal-Dual Algorithm P&S Chapter 5 Last Revised October 30, 2006 1 Simplex solves LP by starting at a Basic Feasible Solution (BFS) and moving from BFS to BFS, always improving the objective function,
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 informationPart 1. The Review of Linear Programming Introduction
In the name of God Part 1. The Review of Linear Programming 1.1. Spring 2010 Instructor: Dr. Masoud Yaghini Outline The Linear Programming Problem Geometric Solution References The Linear Programming Problem
More informationA Parametric Simplex Algorithm for Linear Vector Optimization Problems
A Parametric Simplex Algorithm for Linear Vector Optimization Problems Birgit Rudloff Firdevs Ulus Robert Vanderbei July 9, 2015 Abstract In this paper, a parametric simplex algorithm for solving linear
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 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 informationPart 1. The Review of Linear Programming
In the name of God Part 1. The Review of Linear Programming 1.2. Spring 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Basic Feasible Solutions Key to the Algebra of the The Simplex Algorithm
More information