Duality Flashcards

1
Q

what is normal form?

A

Just a nice form that help us in the dual primal connection

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

Give matrix notation for the primal and the dual problem when everything is in normal form

A

PRIMAL

max z = c^(T)x

s.t. Ax<=b
x>=0

DUAL

min w = b^(T)v

s.t. A^(T)v >= c
v >= 0

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

Elaborate on the 6 cases

A

1) A variable in normal form in the primal, gives a constraint in normal form in the dual

2) A constraint in normal form in the primal, gives a variable in normal form in the dual

3) A variable defined as xj <= 0 in the primal, gives a constraint in the dual that has reverse of normal form type

4) A constraint in the primal that is reverse of normal form, gives a variable in the dual defined as vi <= 0

5) A free variable in the primal gives an equality constraint in the dual

6) An equality constraint in the primal gives a free variable in the dual

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

Elaborate on weak duality

A

if x and v are feasible solutions to their own problems, then the following result apply for max problems:

cx <= bv

If the problem is a min problem, the weak duality line is flipped:

cx >= bv

What does this mean?
It means that the dual solution, as long as it is feasible, is always an optimistic bound to the primal solution.

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

What follows from the weak duality theorem?

A

If we have feasible solutions v and x, and we have that cx = bv, then x and v are optimal solutions to their own problems.

the resonign for this is that the dual is always an optimistic solution. They are optimistic solution to each other. If they are equal, they must represent the optimal.

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

What is strong duality?

A

If one of the problems has a bounded optimal solution, so must the other. And the two objective function values are equal at the optimum:

cx = bv

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

What is the dual theorem?

A

Assume that xb = B^(-1)b is an optimal solution to P. Then v = cb B^(-1) is an optimal solution to D, and z star == w star.

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

Recall what happens if a constraint is not active

A

Its corresponding shadow price is 0

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

elaborate on what we can use the constraints binding vs shadow price value for

A

Complementary slackness.

The relationship between a primal constraint “i” and a dual variable “vi” is given by the complementary slackness constraint:

vi (bi - ∑aij xj) = 0

this say that either the dual variable is 0, or the constraint is binding. Both can be zero as well.

The same relationship apply to dual constraints and primal variables:

xj (∑aij vi - cj) = 0

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