2. Duality Theory  Every LP problem (called the ‘Primal’) has associated with another problem called the ‘Dual’.  The ‘Dual’ problem is an LP defined directly and systematically from the original (or Primal) LP model.  The optimal solution of one problem yields the optimal solution to the other.  Duality ease the calculations for the problems, whose number of variables is large.

3. Rules for converting Primal to Dual  If the Primal is to maximize, the dual is to minimize.  If the Primal is to minimize, the dual is to maximize.  For every constraint in the primal, there is a dual variable.  For every variable in the primal, there is a constraint in the dual.

4. Dual Problem Primal LP : Max z = c 1 x 1 + c 2 x 2 +... + c n x n Max z = c 1 x 1 + c 2 x 2 +... + c n x n subject to: a 11 x 1 + a 12 x 2 +... + a 1n x n ≤ b 1 a 21 x 1 + a 22 x 2 +... + a 2n x n ≤ b 2 : a m1 x 1 + a m2 x 2 +... + a mn x n ≤ b m a m1 x 1 + a m2 x 2 +... + a mn x n ≤ b m x 1 ≥ 0, x 2 ≥ 0,…….x j ≥ 0,……., x n ≥ 0. x 1 ≥ 0, x 2 ≥ 0,…….x j ≥ 0,……., x n ≥ 0. Associated Dual LP : Min. z = b 1 y 1 + b 2 y 2 +... + b m y m subject to: a 11 y 1 + a 21 y 2 +... + a m1 y m ≥ c 1 a 12 y 1 + a 22 y 2 +... + a m2 y m ≥ c 2 : a 1n y 1 + a 2n y 2 +... + a mn y m ≥ c n y 1 ≥ 0, y 2 ≥ 0,…….y j ≥ 0,……., y m ≥ 0.

5. Example Primal Max. Z = 3x 1 +5x 2 Subject to constraints: < 4 y 1 x 1 < 4 y 1 2x 2 < 12 y 2 2x 2 < 12 y 2 3x 1 +2x 2 < 18 y 3 3x 1 +2x 2 < 18 y 3 x 1, x 2 x 1, x 2 > 0 The Primal has: 2 variables and 3 constraints. So the Dual has: 3 variables and 2 constraints Dual Min. Z’ = 4y 1 +12y 2 +18y 3 Subject to constraints: 3 y 1 + 3y 3 > 3 2y 2 +2y 3 5 2y 2 +2y 3 > 5 y 1, y 2, y 3 y 1, y 2, y 3 > 0 We define one dual variable for each primal constraint.

6. Example Primal Min.. Z = 10x 1 +15x 2 Subject to constraints: 80 5x 1 + 7x 2 > 80 6x 1 + 11x 2 100 6x 1 + 11x 2 > 100 x 1, x 2 x 1, x 2 > 0

7. Solution Dual Max.. Z’ = 80y 1 +100y 2 Subject to constraints: < 10 5y 1 + 6y 2 < 10 7y 1 + 11y 2 < 15 7y 1 + 11y 2 < 15 y 1, y 2 y 1, y 2 > 0

8. Example Primal Max. Z = 12x 1 + 4x 2 Subject to constraints: < 56 4x 1 + 7x 2 < 56 2x 1 + 5x 2 20 2x 1 + 5x 2 > 20 5x 1 + 4x 2 = 40 5x 1 + 4x 2 = 40 x 1, x 2 x 1, x 2 > 0

9. Solution 5x 1 + 4x 2 = 40  The equality constraint 5x 1 + 4x 2 = 40 can be replaced by the following two inequality constraints: 5x 1 + 4x 2 < 40 5x 1 + 4x 2 < 40 5x 1 + 4x 2 40 -5x 1 - 4x 2 40 -5x 1 - 4x 2 < -40 2x 1 + 5x 2 20  The second inequality 2x 1 + 5x 2 > 20 can be changed to the less-than-or-equal-to type by multiplying both sides of the inequality by -1 and reversing the direction of the inequality; that is, -2x 1 - 5x 2 < -20 -2x 1 - 5x 2 < -20

10. Cont… The primal problem can now take the following standard form: Max. Z = 12x 1 + 4x 2 Subject to constraints: < 56 4x 1 + 7x 2 < 56 -2x 1 - 5x 2 < -20 -2x 1 - 5x 2 < -20 5x 1 + 4x 2 < 40 5x 1 + 4x 2 < 40 -5x 1 - 4x 2 < -40 -5x 1 - 4x 2 < -40 x 1, x 2 x 1, x 2 > 0

11. Cont… Min. Z’ = 56y 1 -20y 2 + 40y 3 – 40y 4 Subject to constraints: 12 4y 1 – 2y 2 + 5y 3 – 5y 4 > 12 7y 1 - 5y 2 + 4y 3 – 4y 4 4 7y 1 - 5y 2 + 4y 3 – 4y 4 > 4 y 1, y 2, y 3, y 4 y 1, y 2, y 3, y 4 > 0 The dual of this problem can now be obtained as follows:

12. Example Primal Min.. Z = 2x 2 + 5x 3 Subject to constraints: 2 x 1 + x 2 > 2 2x 1 + x 2 +6x 3 < 6 2x 1 + x 2 +6x 3 < 6 x 1 - x 2 +3x 3 = 4 x 1 - x 2 +3x 3 = 4 x 1, x 2, x 3 x 1, x 2, x 3 > 0

13. Solution Primal in standard form : Max.. Z = -2x 2 - 5x 3 Subject to constraints: < -2 -x 1 - x 2 < -2 2x 1 + x 2 +6x 3 < 6 2x 1 + x 2 +6x 3 < 6 x 1 - x 2 +3x 3 < 4 x 1 - x 2 +3x 3 < 4 - x 1 + x 2 - 3x 3 < -4 - x 1 + x 2 - 3x 3 < -4 x 1, x 2, x 3 x 1, x 2, x 3 > 0

14. Cont… Dual Min. Z’ = -2y 1 + 6y 2 + 4y 3 – 4y 4 Subject to constraints: 0 -y 1 + 2y 2 + y 3 – y 4 > 0 -y 1 + y 2 - y 3 + y 4 -2 -y 1 + y 2 - y 3 + y 4 > -2 6y 2 + 3y 3 - 3y 4 -5 6y 2 + 3y 3 - 3y 4 > -5 y 1, y 2, y 3, y 4 y 1, y 2, y 3, y 4 > 0

16. Introduction Suppose a “basic solution” satisfies the optimality condition but not feasible, then we apply dual simplex method. In regular Simplex method, we start with a Basic Feasible solution (which is not optimal) and move towards optimality always retaining feasibility. In the dual simplex method, the exact opposite occurs. We start with a “optimal” solution (which is not feasible) and move towards feasibility always retaining optimality condition.The algorithm ends once we obtain feasibility.

17. Dual Simplex Method To start the dual Simplex method, the following two conditions are to be met: 1.The objective function must satisfy the optimality conditions of the regular Simplex method. 2.All the constraints must be of the type .

18. Example Min. Z = 3x 1 + 2x 2 Subject to constraints: 3 3x 1 + x 2 > 3 4x 1 + 3x 2 6 4x 1 + 3x 2 > 6 x 1 + x 2 < 3 x 1, x 2 x 1, x 2 > 0

19. Cont… < constraints and convert the objective function into maximization function. Step I: The first two inequalities are multiplied by –1 to convert them to < constraints and convert the objective function into maximization function. Max. Z’ = -3x 1 - 2x 2 where Z’= -Z Subject to constraints: < -3 -3x 1 - x 2 < -3 -4x 1 - 3x 2 < -6 x 1 + x 2 < 3 x 1 + x 2 < 3 x 1, x 2 x 1, x 2 > 0

20. Cont… Let S 1, S 2, S 3 be three slack variables Model can rewritten as: Z’ + 3x 1 + 2x 2 = 0 -3 -3x 1 - x 2 +S 1 = -3 -4x 1 - 3x 2 +S 2 = -6 -4x 1 - 3x 2 +S 2 = -6 x 1 + x 2 +S 3 = 3 x 1 + x 2 +S 3 = 3 Initial BS is : x 1 = 0, x 2 = 0, S 1 = -3, S 2 = -6, S 3 = 3 and Z=0.

21. Cont… Basic Variable Coefficients of:Sol. Zx1x1 x2x2 S1S1 S2S2 S3S3 Z1320000 S1S1 0-3100-3 S2S2 0-4-3010-6 S3S3 0110013 Ratio-3/42/3--- Initial Basic Solution is Optimal (as the optimality condition is satisfied) but infeasible. Choose the most negative basic variable. Therefore, S 2 is the departing variable. Calculate Ratio = |Z row / S 2 row| (S 2 < 0) Choose minimum ratio. Therefore, x 2 is the entering variable.

22. Cont… Basic Variable Coefficients of:Sol. Zx1x1 x2x2 S1S1 S2S2 S3S3 Z11/3002/304 S1S1 0-5/301-1/30 x2x2 04/310-1/302 S3S3 0 001/311 Ratio-1/5--2- Therefore, S 1 is the departing variable and x 1 is the entering variable.

23. Cont… Basic Variable Coefficients of:Sol. Zx1x1 x2x2 S1S1 S2S2 S3S3 Z1001/53/5021/5 x1x1 010-3/51/503/5 x2x2 0014/5-3/506/5 S3S3 000-1/52/516/5 Optimal Solution is : x 1 = 3/5, x 2 = 6/5, Z= 21/5

24. Example Max. Z = -x 1 - x 2 Subject to constraints: < 8 x 1 + x 2 < 8 x 2 3 x 2 > 3 -x 1 + x 2 < 2 x 1, x 2 x 1, x 2 > 0

25. Cont… Let S 1, S 2, S 3 be three slack variables Model can rewritten as: Z + x 1 + x 2 = 0 8 x 1 + x 2 + S 1 = 8 -x 2 + S 2 = -3 -x 2 + S 2 = -3 -x 1 + x 2 + S 3 = 2 x 1, x 2 x 1, x 2 > 0 Initial BS is : x 1 = 0, x 2 = 0, S 1 = 8, S 2 = -3, S 3 = 2 and Z=0.

26. Cont… Basic Variable Coefficients of:Sol. Zx1x1 x2x2 S1S1 S2S2 S3S3 Z1110000 S1S1 0111008 S2S2 00010-3 S3S3 010012 Ratio--1--- Therefore, S 2 is the departing variable and x 2 is the entering variable.

27. Cont… Basic Variable Coefficients of:Sol. Zx1x1 x2x2 S1S1 S2S2 S3S3 Z110010-3 S1S1 0101105 x2x2 001003 S3S3 0 0011 Ratio-1---- Therefore, S 3 is the departing variable and x 1 is the entering variable.

28. Cont… Basic Variable Coefficients of:Sol. Zx1x1 x2x2 S1S1 S2S2 S3S3 Z100021-4 S1S1 0001204 x2x2 001003 x1x1 0100 1 Optimal Solution is : x 1 = 1, x 2 = 3, Z= -4