A Two-Phase Method for the Simplex Tableau

A version of a two-phase simplex technique is given for manually solving those linear-programming problems in which artificial vectors are introduced and subsequently driven out. The first phase of the method determines feasibility, provided it exists, the second phase, which follows, searches for optimality.