Linear Programming Lecture Notes - Penn State Personal Web Server
Linear Programming Lecture Notes - Penn State Personal Web Server
Linear Programming Lecture Notes - Penn State Personal Web Server
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Using this information, we can see that either x1 or x2 can enter. We can compute the<br />
minimum ratio test (MRT) next to the RHS column. If we chose x2 as the entering variable,<br />
then the MRT tells us s2 will leave. We put a box around the element on which we will<br />
pivot:<br />
(5.29)<br />
z<br />
s1<br />
s2<br />
s3<br />
⎡<br />
⎢<br />
⎣<br />
z x1 x2 s1 s2 s3 RHS<br />
1 −7 −6 0 0 0 0<br />
0 3 1 1 0 0 120<br />
0 1 2 0 1 0 160<br />
0 1 0 0 0 1 35<br />
⎤<br />
⎥<br />
⎦<br />
MRT (x2)<br />
If we pivot on this element, then we transform the column corresponding to x2 into the<br />
identity column:<br />
⎡ ⎤<br />
0<br />
⎢<br />
(5.30) ⎢0<br />
⎥<br />
⎣1⎦<br />
0<br />
This process will correctly compute the new reduced costs and B−1 matrix as well as the<br />
new cost information. The new tableau becomes:<br />
⎡<br />
⎤<br />
z x1 x2 s1 s2 s3 RHS<br />
z ⎢ 1 −4 0 0 3 0 480 ⎥<br />
(5.31) s1 ⎢ 0 2.5 0 1 −0.5 0 40 ⎥<br />
x2 ⎣ 0 0.5 1 0 0.5 0 80 ⎦<br />
0 1 0 0 0 1 35<br />
s3<br />
We can see that x1 is a valid entering variable, as it has a negative reduced cost (−4). We<br />
can again place the minimum ratio test values on the right-hand-side of the matrix to obtain:<br />
(5.32)<br />
z<br />
s1<br />
x2<br />
s3<br />
⎡<br />
⎢<br />
⎣<br />
z x1 x2 s1 s2 s3 RHS<br />
1 −4 0 0 3 0 480<br />
0 2.5 0 1 −0.5 0 40<br />
0 0.5 1 0 0.5 0 80<br />
0 1 0 0 0 1 35<br />
⎤<br />
⎥<br />
⎦<br />
120<br />
80<br />
−<br />
MRT (x1)<br />
16<br />
160<br />
35<br />
We now pivot on the element we have boxed to obtain the new tableau1 :<br />
⎡<br />
⎤<br />
z x1 x2 s1 s2 s3 RHS<br />
z ⎢ 1 0 0 1.6 2.2 0 544 ⎥<br />
(5.33) x1 ⎢ 0 1 0 0.4 −0.2 0 16 ⎥<br />
x2 ⎣ 0 0 1 −0.2 0.6 0 72 ⎦<br />
0 0 0 −0.4 0.2 1 19<br />
s3<br />
All the reduced costs of the non-basic variables (s1 and s2) are positive and so this is the<br />
optimal solution to the linear programming problem. We can also see that this solution<br />
agrees with our previous computations on the Toy Maker Problem.<br />
1 Thanks to Ethan Wright for catching a typo here.<br />
80