The Cross-Section Method: An Algorithm for Linear Programming

An algorithm that solves the linear-programming problem. This algorithm combines the usual phase one (obtaining feasibility) and phase two (obtaining optimality) of the simplex or dual methods into a single phase.