This section presents two additional algorithms : The dual simplex and the generalized simplex. In the dual simplex , the LP starts at a better than optimal infeasible (basic) solution. Successive iterations remain infeasible and (better than) optimal until feasibility is restored at the last iteration. The generalized simplex combines both the primal and dual simplex methods in one algorithm. It deals with problem that start both non optimal and infeasible. In this algorithm , successive iterations are associated with basic feasible or infeasible (basic) solutions. At the final iteration , the solution becomes optimal and feasible (assuming that one exists).