MT278: Linear Programming – 2017/2018

Tutorial 8 – Duality

1. Consider the following LP:

max z = −2x1 − x2 + x3
s.t x1 + x2 + x3 ≤ 3
x2 + x3 ≥ 2
x1 + x3 = 1
x1 , x2 , x3 ≥0

(a) Find the dual of this LP.

(b) After adding a slack variable x4 , subtracting an excess variable x5 and adding artificial
variables x6 and x7 , row 0 of the LP’s optimal tableau is found to be

z + 4x1 + x5 + (M − 1)x6 + (M + 2)x7 = 0

Find the optimal solution to the dual of this LP.

2. Find the dual of the following LPs:

(a)

max z = 4x1 − x2 + 2x3

s.t x1 + x2 ≤ 5
2x1 + x2 ≤ 7
2x2 + x3 ≥ 6
x1 + x3 = 4
x1 ≥ 0, x2 , x3 urs

(b)

min z = 4y1 + 2y2 − y3

s.t y1 + 2y2 ≤ 6
y1 − y2 + 2y3 = 8
y1 , y2 ≥ 0, y3 urs

Solve the above LPs by examining the solution of the dual. Is there any advantage
of using the dual solution for these cases?

3. Refer the Giapetto problem of tutorial 2 task 6

(a) Find the dual of the Giapetto problem

(b) Use the optimal tableau of the Giapetto problem to determine the optimal dual
solution
(c) Verify the Dual Theorem holds in this instance.