Two phase method Examples hw 3 3 Two

Two phase method Examples & hw

3 -3 Two – Phase Method The process of eliminating artificial variables is performed in phase- I of the solution and phase-II is used to get an optimal solution. Since the solution of LPP is computed in two phases, it is called as Two- Phase Simplex Method. Phase I – in this phase, the simplex method is applied to a specially constructed auxiliary linear programming problem leading to a final simplex table containing a basic feasible solution to the original problem. Step 1 - assign a cost-1 to each artificial variable and a cost 0 to all other variables in the objective function. Step 2 - construct the auxiliary LPP in which the new objective function z* is to be maximized subject to the given set of constraints.

Phase I Cj 0 0 X 2 0 0 0 -1 s 2 s 3 R 1 Basic var X 1 R 1 -1 2 1 -1 0 0 1 2 S 2 0 1 3 0 1 0 0 2 S 3 0 0 1 0 4 Z -2 -1 1 0 0 0 -2 x 1 1 1/2 -1/2 0 0 x 1 S 2 0 5/2 1 0 x 1 S 3 0 1 0 0 1 x 4 Z 0 0 x 0 0 SOL

Phase II Cj 3 -1 0 0 0 Basic var X 1 X 2 s 1 s 2 s 3 SOL X 1 3 1 1/2 -1/2 0 0 1 S 2 0 0 5/2 1 0 1 S 3 0 0 1 4 Z 0 5/2 -3/2 0 X 1 1 3 0 0 0 2 S 1 0 5 1 2 0 2 S 3 0 1 0 0 1 4 Z 0 10 0 3 0 6 0 3

Cj 0 0 0 -1 -1 S 2 S 3 R 1 R 2 Basic var X 1 X 2 R 1 -1 3 2 -1 0 0 1 0 3 R 2 -1 1 4 0 -1 0 0 1 4 S 3 1 1 0 0 5 Z -4 -6 1 1 0 0 0 -7 R 1 5/2 0 -1 1/2 0 1 X 2 1/4 1 0 -1/4 0 0 X 1 S 3 3/4 0 0 1/4 1 0 X 4 Z -5/2 0 1 -1/2 0 0 X -1 X 1 1 0 -2/5 1/5 0 X X 2/5 X 2 0 1 1/10 -3/10 0 X X 9/10 S 3 0 0 3/10 1 X X 37/10 Z*=0 0 0 X 0 0 0 SOL

Cj 5 8 Basic var X 1 X 2 x 1 5 1 X 2 8 S 3 0 0 0 s 1 s 2 s 3 SOL 0 -2/5 1/5 0 2/5 0 1 1/10 -3/10 0 9/10 0 0 3/10 1 37/10 Z 0 0 -6/5 -7/5 0 46/5 S 2 5 0 -2 1 0 2 x 2 3/2 1 -1/2 0 0 3/2 s 3 -1/2 0 1 7/2 Z 7 0 -4 0 0 12 S 3 3 0 0 1 2 16 X 2 1 1 0 0 1/2 5 S 1 -1 0 2 7 Z 3 0 0 0 4 40 0 X 1=0 X 2=5 Z=40