1. 7(2).1 7.4 THE DUAL THEOREMS Primal ProblemDual Problem b is not assumed to be non-negative

2. 7(2).2 7.4.1 Weak Duality Theorem If x is a feasible solution to the primal problem from (7.13) and y is a feasible solution to the dual problem, then cx  by. If x is a feasible solution to the primal problem from (7.13) and y is a feasible solution to the dual problem, then cx  by. : Proof: If x is a feasible solution to the Primal Problem, then we must have: Ax  b Ax  b So, if y is a feasible solution to the Dual Problem, we must have (why?) yAx  yb yAx  yb

3. 7(2).3 Similarly, if y is feasible for the Dual, then Similarly, if y is feasible for the Dual, then yA ≥ c yA ≥ c and therefore (why?) for any feasible solution, x, of the Primal Problem we have yAx ≥ cx yAx ≥ cx It follows then that cx  by. cx  by.

4. 7(2).4 This result implies that the optimal objective function values for the primal and dual systems are bounded above and below respectively by the other problem. This result implies that the optimal objective function values for the primal and dual systems are bounded above and below respectively by the other problem. What are the implications for the solutions? What are the implications for the optimal solutions? We shall deal with this question shortly. We shall deal with this question shortly.

5. 7(2).5 7.4.2 Lemma If a linear programming problem has an unbounded objective, then its dual problem has no feasible solution. If a linear programming problem has an unbounded objective, then its dual problem has no feasible solution. : Observation: It is possible that the primal and the dual problem are infeasible. It is possible that both the primal and the dual problem are infeasible.

6. 7(2).6 7.4.3 Lemma Let x* be a feasible solution to the primal problem and y* a feasible solution to the dual. Then cx* = by* implies that x* is an optimal solution for the primal and y* is optimal for the dual. Let x* be a feasible solution to the primal problem and y* a feasible solution to the dual. Then cx* = by* implies that x* is an optimal solution for the primal and y* is optimal for the dual. : Proof: From the Weak Duality theorem we have From the Weak Duality theorem we have cx  by cx  by hence we also have cx  by* cx  by*

7. 7(2).7 for any feasible solution x of the primal and any optimal solution y* of the dual. Thus, for any feasible solution x* of the primal for which cx*=by* we have (why?) cx  cx* cx  cx* for any feasible solution, x, of the primal. This implis that x* is an optimal solution for the primal.

8. 7(2).8 7.4.4 Strong Duality Theorem If an optimal solution exists for either the primal or its dual, then an optimal solution exists for both and the corresponding optimal objective function values are equal, namely Z* = w*. If an optimal solution exists for either the primal or its dual, then an optimal solution exists for both and the corresponding optimal objective function values are equal, namely Z* = w*. : Bottom Line: Proof: Bottom Line: Let B -1* be the “optimal” value of B -1 (final tableau) and define: Let B -1* be the “optimal” value of B -1 (final tableau) and define: y*:=c B B -1* y*:=c B B -1*

9. 7(2).9 Then show that y* is feasible for the dual and y*b = z*. Then show that y* is feasible for the dual and y*b = z*. In view of the Weak Duality Theorem, this will imply that y* is optimal for the dual. In view of the Weak Duality Theorem, this will imply that y* is optimal for the dual. Alternatively,....... have a look at the tableau itself.... Alternatively,....... have a look at the tableau itself....

10. 7(2).10 y = c B B -1 for any simplex tableau not necessarily the final one This is implied by our beloved recipe: r = c B B -1 D - c

11. 7(2).11 Important Observations IN ANY TABLEAU, THE CORRESPONDING TO THE PRIMAL BASIC FEASIBLE SOLUTION ARE THE IN ANY TABLEAU, THE DUAL VARIABLES CORRESPONDING TO THE PRIMAL BASIC FEASIBLE SOLUTION ARE THE REDUCED COSTS FOR THE PRIMAL SLACK VARIABLES. IN APPLYING THE SIMPLEX METHOD TO THE PRIMAL PROBLEM, WE ALSO SOLVE ITS DUAL. IN APPLYING THE SIMPLEX METHOD TO THE PRIMAL PROBLEM, WE ALSO SOLVE ITS DUAL.

12. 7(2).12 7.4.6 Example

13. 7(2).13