06.09.2021 Views

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

6.3. THE SIMPLEX ALGORITHM 149<br />

Of course there is a problem with the obvious solution obtained by setting to zero all<br />

variables corresponding to a nonsimple column because of the simple column which has the<br />

−1 in it. Therefore, I will use the simplex algorithm to make this column non simple. The<br />

third column has the 1 in the second row as the pivot so I will use this column. This yields<br />

⎛<br />

⎜<br />

⎝<br />

0 0 0 1 1 0 0 8<br />

1 1 1 0 −1 0 0 2<br />

−2 −2 0 0 3 1 0 2<br />

0 1 0 0 1 0 1 5<br />

⎞<br />

⎟<br />

⎠ (6.17)<br />

and the obvious solution is feasible. Now it is time to assemble the simplex tableau. First<br />

add in the bottom row and second to last column corresponding to the equation for z. This<br />

yields<br />

⎛<br />

⎞<br />

0 0 0 1 1 0 0 0 8<br />

1 1 1 0 −1 0 0 0 2<br />

⎜ −2 −2 0 0 3 1 0 0 2<br />

⎟<br />

⎝ 0 1 0 0 1 0 1 0 5 ⎠<br />

−1 3 −1 0 0 0 0 1 0<br />

Next you need to zero out the entries in the bottom row which are below one of the simple<br />

columns in (6.17). This yields the simplex tableau<br />

⎛<br />

⎞<br />

0 0 0 1 1 0 0 0 8<br />

1 1 1 0 −1 0 0 0 2<br />

⎜ −2 −2 0 0 3 1 0 0 2<br />

⎟<br />

⎝ 0 1 0 0 1 0 1 0 5 ⎠ .<br />

0 4 0 0 −1 0 0 1 2<br />

The desire is to minimize this so you need to get rid of the positive entries in the left bottom<br />

row. There is only one such entry, the 4. In that column the pivot is the 1 in the second<br />

row of this column. Thus the next tableau is<br />

⎛<br />

⎜<br />

⎝<br />

0 0 0 1 1 0 0 0 8<br />

1 1 1 0 −1 0 0 0 2<br />

0 0 2 0 1 1 0 0 6<br />

−1 0 −1 0 2 0 1 0 3<br />

−4 0 −4 0 3 0 0 1 −6<br />

There is still a positive number there, the 3. The pivot in this column is the 2. Apply the<br />

algorithm again. This yields<br />

⎛<br />

1<br />

1<br />

2<br />

0<br />

2<br />

1 0 0 − 1 ⎞<br />

13<br />

2<br />

0<br />

2<br />

1<br />

1<br />

1<br />

7<br />

2<br />

1<br />

2<br />

0 0 0<br />

2<br />

0 2<br />

1<br />

5<br />

⎜ 2<br />

0<br />

2<br />

0 0 1 − 1 9<br />

2<br />

0 2 ⎟<br />

⎝ − 1 2<br />

0 − 1 1<br />

3<br />

2<br />

0 1 0<br />

2<br />

0 ⎠ .<br />

2<br />

− 5 2<br />

0 − 5 2<br />

0 0 0 − 3 2<br />

1 − 21 2<br />

Now all the entries in the left bottom row are nonpositive so the process has stopped. The<br />

minimum is −21/2. It occurs when x 1 =0,x 2 =7/2,x 3 =0.<br />

Now consider the same problem but change the word, minimize to the word, maximize.<br />

Example 6.3.5 Maximize z = x 1 − 3x 2 + x 3 subject to the constraints x 1 + x 2 + x 3 ≤<br />

10,x 1 + x 2 + x 3 ≥ 2, x 1 + x 2 +3x 3 ≤ 8 and x 1 +2x 2 + x 3 ≤ 7 with all variables nonnegative.<br />

⎞<br />

⎟<br />

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!