 In the first step, known as Phase I, a starting extreme point is found.Depending on the nature of the program this may be trivial, but in general it can be solved by applying the simplex algorithm to a modified version of the original program.The possible results of Phase I are either that a basic feasible solution is found or that the feasible region is empty.