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.
here we are interested only in directions satisfying e T d = 1. This is a normalizing constraint<br />
that will chose only vectors whose components sum to 1.<br />
Theorem 4.39. A direction d ∈ D is an extreme direction of P if and only if d is an<br />
extreme point of D when D is taken as a polyhedral set.<br />
Proof. (⇒)Suppose that d is an extreme point of D (as a polyhedral set) and not an<br />
extreme direction of P . Then there exist two directions d1 and d2 of P and two constants λ1<br />
and λ2 with λ1, λ2 ≥ 0 so that d = λ1d1 + λ2d2. Without loss of generality, we may assume<br />
that d1 and d2 are vectors satisying e T di = 1 (i = 1, 2). If not, then we can scale them so<br />
their components sum to 1 and adjust λ1 and λ2 accordingly. But this implies that:<br />
1 = e T d = λ1e T d1 + λ2e T d2 = λ1 + λ2<br />
Further, the fact that d1 and d2 are directions of P implies they must be in D. Thus we have<br />
found a convex combination of element of D that equals d, contradicting our assumption<br />
that d was an extreme point.<br />
(⇐)Conversely, suppose that d is an extreme direction of P whose components sum to<br />
1 and not an extreme point of D. (Again, we could scale d if needed.) Then d cannot be<br />
recovered from a positive combination of directions d1 and d2. But if d is not an extreme<br />
point of D, then we know λ1d1 +λ2d2 = d for d1, d2 ∈ D and λ1 +λ2 = 1 and λ1, λ2 ∈ (0, 1).<br />
This is clearly contradictory. Every strict convex combination is a positive combination and<br />
therefore our assumption that d was an extreme direction was false. <br />
Example 4.40. Let’s consider Example 4.26 again. The polyhedral set in this example<br />
was defined by the A matrix:<br />
<br />
1 −1<br />
A =<br />
−2 −1<br />
and the b vector:<br />
<br />
1<br />
b =<br />
−6<br />
If we assume that P = {x ∈ R n : Ax ≤ b, x ≥ 0}, then the set of extreme directions of P<br />
is the same as the set of extreme points of the set<br />
D = {d ∈ R n : Ad ≤ 0, d ≥ 0, e T d = 1}<br />
Then we have the set of directions d = [d1, d2] T so that:<br />
d1 − d2 ≤ 0<br />
−2d1 − d2 ≤ 0<br />
d1 + d2 = 1<br />
d1 ≥ 0<br />
d2 ≥ 0<br />
The feasible region (which is really only the line d1 + d2 = 1) is shown in red in Figure<br />
4.10. The critical part of this figure is the red line. It is the true set D. As a line, it has<br />
two extreme points: (0, 1) and (1/2, 1/2). Note that (0, 1) as an extreme point is one of the<br />
direction [0, 1] T we illustrated in Example 4.26.<br />
63