You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If you need an accessible version of this item please contact JSTOR User Support
Preview not available
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.
Operations Research © 1956 INFORMS