Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

A Two-Phase Method for the Simplex Tableau

Harvey M. Wagner
Operations Research
Vol. 4, No. 4 (Aug., 1956), pp. 443-447
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/167312
Page Count: 5
  • Download ($30.00)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
A Two-Phase Method for the Simplex Tableau
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
443
    443
  • Thumbnail: Page 
444
    444
  • Thumbnail: Page 
445
    445
  • Thumbnail: Page 
446
    446
  • Thumbnail: Page 
447
    447