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 the rule you developed in Exercise 49, show that the minimization problem has an<br />
unbounded feasible solution. Find an extreme direction for this set. [Hint: The minimum<br />
ratio test is the same for a minimization problem. Execute the simplex algorithm as we did<br />
in Example 5.11 and use Theorem 5.12 to find the extreme direction of the feasible region.]<br />
6. Identifying Alternative Optimal Solutions<br />
We saw in Theorem 5.6 that is zj − cj > 0 for all j ∈ J (the indices of the nonbasic<br />
variables), then the basic feasible solution generated by the current basis was optimal.<br />
Suppose that zj − cj ≥ 0. Then we have a slightly different result:<br />
Theorem 5.13. In Problem P for a given set of non-basic variables J , if zj − cj ≥ 0<br />
for all j ∈ J , then the current basic feasible solution is optimal. Further, if zj − cj = 0 for<br />
at least one j ∈ J , then there are alternative optimal solutions. Furthermore, let aj be the<br />
j th column of B −1 A·j. Then the solutions to P are:<br />
(5.39)<br />
⎧<br />
xB = B −1 b − ajxj<br />
⎪⎨ <br />
bi<br />
xj ∈ 0, min : i = 1, . . . , m, aji<br />
aji<br />
⎪⎩<br />
xr = 0, ∀r ∈ J , r = j<br />
<br />
> 0<br />
Proof. It follows from the proof of Theorem 5.6 that the solution must be optimal as<br />
∂z/∂xj ≤ 0 for all j ∈ J and therefore increasing and xj will not improve the value of the<br />
objective function. If there is some j ∈ J so that zj − cj = 0, then ∂z/∂xj = 0 and we<br />
may increase the value of xj up to some point specified by the minimum ratio test, while<br />
keeping other non-basic variables at zero. In this case, we will neither increase nor decrease<br />
the objective function value. Since that objective function value is optimal, it follows that<br />
the set of all such values (described in Equation 5.39) are alternative optimal solutions. <br />
Example 5.14. Let us consider the toy maker problem again from Example 2.3 and 5.9<br />
with our adjusted objective<br />
(5.40) z(x1, x2) = 18x1 + 6x2<br />
Now consider the penultimate basis from Example 5.9 in which we had as basis variables x1,<br />
s2 and x2.<br />
⎡<br />
xB = ⎣ x1<br />
⎤<br />
⎡<br />
<br />
s1<br />
x2⎦<br />
xN = cB = ⎣<br />
s3<br />
18<br />
⎤<br />
<br />
6 ⎦ 0<br />
cN =<br />
0<br />
0<br />
s2<br />
The matrices become:<br />
⎡ ⎤ ⎡<br />
3 1 0 1<br />
B = ⎣1 2 1⎦<br />
N = ⎣0 ⎤<br />
0<br />
0⎦<br />
1 0 0 0 1<br />
The derived matrices are then:<br />
B −1 ⎡<br />
b = ⎣ 35<br />
⎤<br />
15⎦<br />
B<br />
95<br />
−1 ⎡<br />
0<br />
N = ⎣ 1<br />
⎤<br />
1<br />
−3⎦<br />
−2 5<br />
84