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.
variables. This is because we started with an identity matrix in this position. As always,<br />
the remainder of the matrix holds B −1 N. Thus, we can read this final tableau as:<br />
(6.12)<br />
z<br />
x2<br />
x1<br />
⎡<br />
⎣<br />
z xB s xa RHS<br />
1 0 0 −e 0<br />
0 I2 B −1 N B −1 B −1 b<br />
In our case from Expression 6.11 we have:<br />
⎡<br />
(6.13)<br />
z<br />
x2<br />
x1<br />
⎢<br />
⎣<br />
z x1 x2 s1 s2 xa1 xa2 RHS<br />
1 0 0 0 0 −1 −1 0<br />
0 0 1 −2 1 2 −1 4<br />
0 1 0 3 −2 −3 2 4<br />
− I2 B −1 N B −1 B −1 b<br />
⎤<br />
⎦<br />
We can use this information (and the reduced costs and objective function we computed)<br />
to start our tableau to solve the problem with which we began. Our next initial tableau will<br />
be:<br />
(6.14)<br />
z<br />
x2<br />
x1<br />
⎡<br />
⎢<br />
⎣<br />
z x1 x2 s1 s2 RHS<br />
1 0 0 −1 0 12<br />
0 0 1 −2 1 4<br />
0 1 0 3 −2 4<br />
⎤<br />
⎥<br />
⎦<br />
Notice all we’ve done is removed the artificial variables from the problem and substituted<br />
the newly computed reduced costs for s1 and s2 (−1 and 0) into Row 0 of the tableau. We’ve<br />
also put the correct objective function value (12) into Row 0 of the right hand side. We’re now<br />
ready to solve the original problem. However, since this is a minimization problem we can<br />
see we’re already at a point of optimality. Notice that all reduced costs are either negative or<br />
zero, suggesting that entering any non-basic variable will at best keep the objective function<br />
value the same and at worst make the objective function worse. Thus we conclude that an<br />
optimal solution for our original problem is x ∗ 1 = x ∗ 2 = 4 and s ∗ 1 = s ∗ 2 = 0.<br />
Theorem 6.4. Let x ∗ , xa ∗ be an optimal feasible solution to problem P1. Problem P is<br />
feasible if and only if xa ∗ = 0.<br />
Proof. We have already proved in Lemma 6.2 that if xa ∗ = 0, then x ∗ is a feasible<br />
solution to P and thus P is feasible.<br />
Conversely, suppose that P is feasible. Then P has at least one basic feasible solution<br />
because the feasible region of P is a polyhedral set and we are assured by Lemma 4.41 that<br />
this set has at least one extreme point. Now we can simply let xa ∗ = 0 and x be this<br />
basic feasible solution to problem P . Then this is clearly an optimal solution to problem P1<br />
because it forces the objective value to its lower bound (zero). <br />
⎤<br />
⎥<br />
⎦<br />
2. The Two-Phase Simplex Algorithm<br />
The two phase simplex algorithm applies the results from the previous section to develop<br />
an end-to-end algorithm for solving an arbitrary linear programming problem.<br />
95