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.
(x ∗ 1,x ∗ 2) = (16, 72)<br />
3x1 + x2 ≤ 120<br />
x1 +2x2 ≤ 160<br />
x1 ≤ 35<br />
x1 ≥ 0<br />
x2 ≥ 0<br />
Figure 8.4. The Gradient Cone: At optimality, the cost vector c is obtuse with<br />
respect to the directions formed by the binding constraints. It is also contained<br />
inside the cone of the gradients of the binding constraints, which we will discuss at<br />
length later.<br />
Exercise 62. Consider the problem:<br />
max x1 + x2<br />
s.t. 2x1 + x2 ≤ 4<br />
x1 + 2x2 ≤ 6<br />
x1, x2 ≥ 0<br />
Write the KKT conditions for an optimal point for this problem. (You will have a vector<br />
w = [w1 w2] and a vector v = [v1 v2]).<br />
Draw the feasible region of the problem. At the optimal point you identified in Exercise<br />
58, identify the binding constraints and draw their gradients. Show that the objective<br />
function is in the positive cone of the gradients of the binding constraints at this point.<br />
(Specifically find w and v.)<br />
The Karush-Kuhn-Tucker Conditions for an Equality Problem. The KKT conditions<br />
can be modified to deal with problems in which we have equality constraints (i.e.,<br />
Ax = b).<br />
Corollary 8.11. Consider the linear programming problem:<br />
⎧<br />
⎪⎨<br />
max cx<br />
(8.41) P<br />
⎪⎩<br />
s.t. Ax = b<br />
x ≥ 0<br />
130