9. Linear Programming II: Duality Flashcards

1
Q

Definition
Convex cone.

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Lemma 9.1 (Hyperplane separation for cones)

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Theorem 9.2 (Farkas’ Lemma)

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Corollary 9.3
there exists x s.t. Ax <= b iff.

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Corollary 9.4
<c, x> <= \delta iff.

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Theorem 9.5 (Duality theorem for linear programming)

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Lemma 9.7
When is supremum attained in polyhedron.

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly