 In the latter case the linear program is called "infeasible".In the second step, Phase II, the simplex algorithm is applied using the basic feasible solution found in Phase I as a starting point.The possible results from Phase II are either an optimum basic feasible solution or an infinite edge on which the objective function is unbounded above.