G&S_W2B Score:

1.    If a linear (minimization) program and its dual both have optimal solutions then
there is a strictly positive duality gap.
A True

B False

2.    The dual of the dual of a linear program P is P itself.

A True

B False

3.    Consider the following linear program:

Max ctx
Ax = b
x≥0

Its dual is given by:

A Min bty
Aty ≥ c

B Min bty
Aty ≥ c
y≥0

C Min bty
Aty = c

D Min bty
Aty = c
y≥0

E None of the propositions.

4.    The weak duality theorem states that solutions of a dual minimization problem
are lower bounds for the primal maximization problem.
A True

B False

5.    According to the strong duality theorem, if the primal problem is feasible and
the dual problem is infeasible then their values vp and vd are such that vp=vd=+∞.
A True

B False

Page 1 of 3
6.    The dual of P:

max 3 x1 + 2 x2
s.t. x1 ≤ 3
x1 + 2 x2 ≤ 6
x1 ≥ 0, x2 ≥ 0

is:

min 3 y1 + 6 y2
s.t. y1 + y2 ≥ 3
2 y2 ≥ 2
y1 ≥ 0, y2 ≥ 0
A True

B False

7.    Consider a linear program and its dual, both having optimal solutions. If the
primal's i-th variable is positive at the optimal solution, the dual's...
A i-th variable is positive at optimum too.

B i-th variable is zero at optimum.

C i-th constraint is tight at optimum.

D i-th constraint is not tight at optimum.

E None of the propositions.

8.    Strong duality holds if and only if...

A the duality gap is zero.

B the duality gap is strictly positive.

C weak duality holds.

D the dual is feasible.

Page 2 of 3
9.    Choose the dual of the following program:

min x1 + 2 x2 - x3;
s.t. x1 - x3 ≥ 2;
2 x1 + x2 + x3 ≥ 4;
x1,x2,x3 ≥ 0.
A max 2 y1 + 4 y2;
s.t. -y1 + y2 ≤ -1;
y2 ≤ 2;
y1 + 2 y2 ≤ 1;
y1, y2 ≥ 0

B max 2 y1 + 4 y2;
s.t. -y1 + y2 ≤ 2;
y2 ≤ 1;
y1 + 2 y2 ≤ -1;
y1, y2 ≥ 0

C max 4 y1 + 2 y2;
s.t. -y1 + y2 ≤ -1;
y1 ≤ 2;
y1 + 2 y2 ≤ 1;
y1, y2 ≥ 0

D max 4 y1 + 2 y2;
s.t. -y1 + y2 ≤ -1;
y2 ≤ 2;
2 y1 + y2 ≤ 1;
y1, y2 ≥ 0

10.    Knowing that x1=0, x2=10.4, x3=0 and x4=0.4 is an optimal solution to:

max 2 x1 + 4 x2 + 3 x3 + x4;
s.t. 3 x1 + x2 + x3 + 4 x4 ≤ 12;
x1 - 3 x2 + 2 x3 + 3 x4 ≤ 7;
2 x1 + x2 + 3 x3 - x4 ≤ 10;
x1, x2, x3, x4 ≥ 0;

You know that for the dual:

A y2 is null and the second and fourth constraints of the dual are tight.

B y1 is strictly positive and the first and third constraint of the dual is not satisfied.

C The dual is infeasible because not all the primal constraints are tight.

D There must be an error somewhere.

Page 3 of 3