Lecture 6 (Two Phase Method)
Lecture 6 (Two Phase Method)
Phase I
In phase I, an artificial objective function is created which is the sum of all the
artificial variables. This new objective function (w) is then minimized, subject to the
constraints of the given (original) problem, using simplex method. At the end of
phase I, three cases arise:
Example 1
Example 2
Phase 2
Since cj – Zj is either negative or zero under all variable columns, the above table gives optimal basic
feasible solution for the original problem. The optimal solution is
55 30 155
x1 = , x2 = , x3 = 0; Zmax =
7 7 7
Example 3