Subject: Re: Linear programing
Date: Wed, 26 Mar 1997 23:47:32 -0500
From: James H.

Alex, thank you for pointing out where I "screwed up." Resolved the tableau;

The whole problem reads:

 Use the simplex method to solve the following:
 Maximize: Z = 2x1 - 6x2 [the 1 & 2 after the x are lowered]
 subject to:
              x1 - x2 <_ 4,
             -x1 + x2 <_ 4,
              x1 + x2 <_ 6,
              x1,x2  >_ 0

 the first tableau:

 Max. Z = 2x1 - 6x2 + 0s1 + 0s2 + 0s2

          x1     x2     s1     s2     s3
 Cb\Cj    2     -6      0      0      0

 s1  0    1     -1      1      0      0       4      pivot row
 s2  0   -1      1      0      1      0       4
 s3  0    1      1      0      0      1       6

 Zj       0      0      0      0      0       0
 Cj-Zj    2     -6      0      0      0
         pivot
         columm

Then, ? I am lost! Can you help?

James

|Reply| |Previous| |Next| |Down| |Exchange index| |Contents| |Store|

Copyright © 1996-2018 Alexander Bogomolny [an error occurred while processing this directive]
[an error occurred while processing this directive]