Duality in LPP

• Every LPP called the primal is associated with

another LPP called the dual. Either of the
problems can be considered as primal with the
other one as its dual.
Write the dual for the following LPP

1. Max Z = 3X1 + 5X2

Subject to:
2X1 + 3X2 ≤ 6
4X1 + 3X2 ≤ 8
3X1 + X2 ≤ -10
X1,X2 ≥ 0
1. Obtain the augmented matrix corresponding
to the given problem.

2 3 6
4 2 8
3 7 -10
3 5 0

2. Obtain the transpose of the above matrix.

 2 4 3 3
3 2 7 5
6 8 -10 0

3. Write the dual for the above matrix.

Min W = 6Y1+ 8Y2 -10Y3

Subject to:
2Y1 + 4Y2 + 3Y3 ≥ 3
3Y1 + 2Y2 + 7Y3 ≥ 5
Y1, Y2,y3 ≥ 0
Write the dual for the following LPP

2. Min Z = 5X1 + 3X2 –

6X3
Subject to:
2X1 - X2 – 4X3 ≥ 10
5X1+ 6X2 + 2X3 ≥ 8
X1,X2 ≥ 0
3. Max Z = 2X1 - 5X2 + 6X3
Subject to:
8X1 + 4X2 + 5X3 ≤ 10
5X1+ 6X2 + 2X3 ≤ 8
X1,X2 ≥ 0
2.
2 -1 -4 10
5 6 2 8
5 3 -6 0

Max W=10Y1+8Y2
Subject to:
2 5 5
-1 6 3 2Y1 + 5Y2 ≤ 5
-4 2 -6 -Y1 + 6Y2 ≤ 3
10 8 0 -4Y1 + 2Y2 ≤ -6
Y1, Y2 ≥ 0
3.
8 4 5 10
9 6 2 8
2 -5 6
0
Min W=10Y1 +8Y2
Subject to:
8 5 2 8Y1+5Y2 ≥ 2
9 6 -5 4Y1+6Y2 ≥ -5
5 2 6
5Y1+2Y2 ≥ 6
10 8 0
Y1, Y2, Y3 ≥ 0
 Solving a Standard
Minimization Problem
Example 1:

1. Min W = 3X1 + 2X2

Subject to:
2X1 + X2 ≥ 6
X1 + X2 ≥ 4
X1,X2 ≥ 0
2 1 6
1 1 4
3 2 0

Max Z=6Y1+4Y2
2 1 3
Subject to:
1 1 2
2Y1 + Y2 ≤ 3
6 4 0
Y1 + Y2 ≤ 2
Y1, Y2 ≥ 0
Final table:
CB CJ 6 4 0 0 Const Ratio
Basis Y1 Y2 S1 S2
6 Y1 1 0 1 -1 1
4 Y2 0 1 -1 2 1
Z -CJ 0 0 2 2

X1 X2

X1 = 2 X2=2
The minimum value for W = 10
Example 2:

Min W = 2X1 + 10X2 + 8X3

Subject to:
X1 + X2 + X3 ≥ 6
Solution:
X + 2X2 ≥ 8
X1 = 2 X2=0
-X1 + 2X2 + 2X3 ≥ 4
X3=4
X1,X2,X3 ≥ 0
W=36