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
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
A1·<br />
Half-space<br />
cy > 0<br />
A2·<br />
c<br />
Am·<br />
Positive Cone of Rows of A<br />
Figure 8.1. System 2 has a solution if (and only if) the vector c is contained inside<br />
the positive cone constructed from the rows of A.<br />
non-empty. This set is the cone of vectors perpendicular to the rows of A. This is illustrated<br />
in Figure 8.2<br />
A2·<br />
Half-space<br />
cy > 0<br />
A1·<br />
Am·<br />
c<br />
Non-empty intersection<br />
Cone of perpendicular<br />
vectors to Rows of A<br />
Figure 8.2. System 1 has a solution if (and only if) the vector c is not contained<br />
inside the positive cone constructed from the rows of A.<br />
Example 8.4. Consider the matrix:<br />
<br />
1 0<br />
A =<br />
0 1<br />
and the vector c = 1 2 . Then clearly, we can see that the vector w = 1 2 will satisfy<br />
System 2 of Farkas’ Lemma, since w ≥ 0 and wA = c.<br />
Contrast this with c ′ = 1 −1 . In this case, we can choose x = 0 1 T . Then<br />
Ax = 0 1 T ≥ 0 and c ′ x = −1. Thus x satisfies System 1 of Farkas’ Lemma.<br />
These two facts are illustrated in Figure 8.3. Here, we see that c is inside the positive<br />
cone formed by the rows of A, while c ′ is not.<br />
Exercise 60. Consider the following matrix:<br />
<br />
1 0<br />
A =<br />
1 1<br />
124