Lizhi Wang lzwangiastateedu IE 534 Linear Programming 12 14

Lizhi wang lzwangiastateedu ie 534 linear programming

This preview shows page 12 - 14 out of 14 pages.

Lizhi Wang ([email protected]) IE 534 Linear Programming October 24, 2012 12 / 14
Image of page 12
Example 4 Suppose we add a new variable x 3 : x 0 = x 1 x 2 x 3 , c 0 = - 1 - 1 1 , A 0 = - 2 - 1 3 - 2 4 - 2 - 1 3 1 . The old optimal solution: ( x * 1 = 7 , x * 2 = 0) and ( y * 1 = 0 , y * 2 = 0 , y * 3 = 1) . y * satisfies the constraint 3 - 2 1 y * 1 . The new optimal solution is ( x 0 1 = 7 , x 0 2 = 0 , x 0 3 = 0) . Lizhi Wang ([email protected]) IE 534 Linear Programming October 24, 2012 13 / 14
Image of page 13
Example 4 A = [-2 -1 3; -2 4 -2; -1 3 1]; b = [4; -8; -7]; c = [-1; -1; 1]; dictionary(A,b,c,[4 1 5],[6 2 3]); Output is ’ ’ ’ ’ ’w6’ ’x2’ ’x3’ ’zeta’ [-7] [-1] [-4] [ 0] ’w4’ [18] [ 2] [ 7] [-1] ’x1’ [ 7] [ 1] [ 3] [ 1] ’w5’ [ 6] [ 2] [ 2] [ 4] Lizhi Wang ([email protected]) IE 534 Linear Programming October 24, 2012 14 / 14
Image of page 14

You've reached the end of your free preview.

Want to read all 14 pages?

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture