9. Linear Programming II: Duality Flashcards
1
Q
Definition
Convex cone.
A
2
Q
Lemma 9.1 (Hyperplane separation for cones)
A
3
Q
Theorem 9.2 (Farkas’ Lemma)
A
4
Q
Corollary 9.3
there exists x s.t. Ax <= b iff.
A
5
Q
Corollary 9.4
<c, x> <= \delta iff.
A
6
Q
Theorem 9.5 (Duality theorem for linear programming)
A
7
Q
Lemma 9.7
When is supremum attained in polyhedron.
A
