G&S_W2A Score:

1.    Every feasible solution of the dual of a maximisation program gives a lower

bound to the primal solutions.
A True

B False

2.    Consider the following linear program:

Max ctx
Ax ≤ b
x≥0

Its dual is given by:

A Min bty
Aty ≥ c
y≥0

B Min bty
Aty ≥ c

C Max bty
Aty ≤ c
y≥0

D Max bty
Aty = c
y≥0

E None of the previous

3.    If a primal problem is feasible and has an optimal solution, then the dual
problem is also feasible and has an optimal solution.
A True

B False

4.    Consider a linear program and its dual. If the primal i-th variable is positive,
then the dual i-th variable is also positive.
A True

B False

Page 1 of 3
5.    Consider the following program,

Maximize 3 x1 + 2 x2
s.t. x1 + 2 x2 ≤ 1
4 x1 + 6 x2 ≤ 6
x1 ≥ 0, x2 ≥ 0

The constraints of the dual are:

A y1 + 4 y2 ≥ 3
2 y1 + 6 y2 ≥ 2
y1 ≥ 0, y2 ≥ 0

B 4 y1 + y2 ≥ 3
2 y1 + 6 y2 ≥ 2
y1 ≥ 0, y2 ≥ 0

C y1 + 4 y2 ≥ 2
2 y1 + 6 y2 ≥ 3
y1 ≥ 0, y2 ≥ 0

D 4 y1 + y2 ≥ 2
2 y1 + 6 y2 ≥ 3
y1 ≥ 0, y2 ≥ 0

E None of the previous

6.    Let vp and vd be respectively the values of a primal maximization problem and

its dual minimization problem. The weak duality theorem states that vp ≤ vd
A True

B False

7.    If a primal problem is infeasible, then its dual is always...

A None of the propositions.

B Bounded.

C Feasible.

D Infeasible.

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

B False

Page 2 of 3
9.    The dual of P:

max 3 x1 + 2 x2
s.t. x1 + x2 = 6
x1 - 2 x2 = 4
x1 ≥ 0, x2 ≥ 0

is:

min 6 y1 + 4 y2
s.t. y1 + y2 ≥ 3
y1 - 2 y2 ≥ 2
A True

B False

10.    Choose the dual of the following program:

minimize -x1 + 2 x2 + 3x3;

s.t. x3 + x2 ≥ 4;
3x1 + x3 ≥ 3
x1 - x2 + 2 x3 ≥ 2;
x1, x2, x3 ≥ 0
A maximize 4 y1 + 3 y2 + 2 y3;
s.t. 3 y2 + y3 ≤ -1;
y1 - y3 ≤ 2;
y1 + y2 + 2 y3 ≤ 3;
y1, y2, y3 ≥ 0

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

C maximize 4 y1 + 3 y2 + 2 y3;
s.t. 3 y2 + y3 ≥ -1;
y1 - y3 ≥ 2;
y1 + y2 + 2 y3 ≥ 3;
y1, y2, y3 ≥ 0

D maximize 3 y1 + 4 y2 + 2 y3;
s.t. 3 y1 + y3 ≥ -1;
y2 - y3 ≥ 2;
y1 + y2 + 2 y3 ≥ 3;
y1, y2, y3 ≥ 0

Page 3 of 3