2. OR-1 20151

3. 2

4. 3 Perturbation Method (tableau form) (after two iterations, optimal solution obtained) (0+2  1 ) (0+2  2 ) (1+  3 )

5. OR-1 20154

6. 5

7. 6 Can cycling be prevented?

8. OR-1 20157  We can read the real solution value by ignoring the  terms in the current dictionary (tableau). It is also observed that the lexicographic method can be started and stopped at any time during the simplex iterations. We just add or drop the  terms at any time and it does not affect the real solution value and the coefficients of other variables in the tableau.

9. Practical Implementation of the Lexicographic Method  In real implementation of the lexicographic method, we do not actually add  terms to the r.h.s., but read the coefficients of  terms from the coefficients of other variables.  Note that, in the example, the coefficient matrix for the basic variables x 5, x 6, x 7 and the coefficient matrix for  1,  2,  3 are the same identity matrices in the beginning of the lexicographic method.  Since we use the elementary row operations in the simplex pivots, those two coefficient matrices have the same elements in the following iterations. Hence, we can read the coefficients of  1,  2,  3 from the coefficients of x 5, x 6, x 7. So we do not actually need to add  1,  2,  3 to the tableau. OR-1 20158

10. 9

11. 10 Example of real implementation (after two iterations)(after two iterations) (0+2  1 ) (0+2  2 ) (1+  3 ) (after two iterations, optimal solution obtained)

12. OR-1 201511 Initialization (two-phase method)

13. OR-1 201512

14. OR-1 201513  Example We cannot perform simplex iteration in this dictionary since the basic solution is not feasible (nonnegativity violated) However a feasible dictionary can be easily obtained by one pivot.

15. OR-1 201514 Perform simplex method. After two iterations, we get the optimal dictionary

16. OR-1 201515

17. OR-1 201516

18. OR-1 201517

19. -w -x 0 = 0 2x 1 - x 2 + 2x 3 - x 0 + x 4 = 4 2x 1 - 3x 2 + x 3 - x 0 + x 5 = -5 -x 1 + x 2 - 2x 3 - x 0 + x 6 = -1 OR-1 201518 -w -2x 1 + 3x 2 - x 3 - x 5 = 5 2x 2 + x 3 + x 4 - x 5 = 9 -2x 1 + 3x 2 - x 3 + x 0 - x 5 = 5 -3x 1 + 4x 2 - 3x 3 - x 5 + x 6 = 4 -w - x 0 = 0 0.2x 1 + x 3 +0.8x 0 - 0.2x 5 - 0.6x 6 = 1.6 -0.6x 1 + x 2 +0.6x 0 - 0.4x 5 - 0.2x 6 = 2.2 x 1 -2x 0 + x 4 + x 6 = 3 tableau form elmentary row operations

20. OR-1 201519 -w - x 0 = 0 0.2x 1 + x 3 +0.8x 0 - 0.2x 5 - 0.6x 6 = 1.6 -0.6x 1 + x 2 +0.6x 0 - 0.4x 5 - 0.2x 6 = 2.2 x 1 -2x 0 + x 4 + x 6 = 3 -z + x 1 - x 2 + x 3 = 0 0.2x 1 + x 3 - 0.2x 5 - 0.6x 6 = 1.6 -0.6x 1 + x 2 - 0.4x 5 - 0.2x 6 = 2.2 x 1 + x 4 + x 6 = 3 -z + 0.2x 1 - 0.2x 5 + 0.4x 6 = 0.6 0.2x 1 + x 3 - 0.2x 5 - 0.6x 6 = 1.6 -0.6x 1 + x 2 - 0.4x 5 - 0.2x 6 = 2.2 x 1 + x 4 + x 6 = 3 Note that the coefficients of x 0 do not affect the coefficients of other variables in the simplex pivots. Suppose we perform the same pivots, disregarding variable x 0. Then we obtain the same final tableau without x 0. The 3 constraints in the initial tableau without variable x 0 defines feasible solution set of the augmented LP (with nonnegativity of variables) Therefore, the final tableau (without x 0 ) describes the same feasible solution set of the LP, i.e. feasible solutions to the equations have not been changed. Now, we can replace the objective function with the original one, and express it in the formal tableau form.

21. OR-1 201520

22. OR-1 201521  (Fundamental theorem of LP) Every LP in standard form has the following properties. 1.If no optimal solution  either unbounded or infeasible. 2.If  feasible solution   a basic feasible solution. 3.If  optimal solution   a basic optimal solution.