Simplex Phase-I Method

Ping-Qi Pan
Additional contact information
Ping-Qi Pan: Southeast University, Department of Mathematics

Chapter Chapter 13 in Linear Programming Computation, 2014, pp 321-339 from Springer

Abstract: Abstract The tableau simplex algorithm requires a feasible simplex tableau to get itself started, whereas the revised simplex algorithm starts from a feasible basis or its inverse. The task of a Phase-I method is to provide such a starting point to Phase-II for achieving optimality. Such a two-Phase methodology has been successful in practice, compared with one-Phase, like the big-M.

Keywords: Simplex Tableau; Feasible Basis; Dual Simplex Algorithm; Auxiliary Program; Basic Feasible Solution (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-40754-3_13

Ordering information: This item can be ordered from
http://www.springer.com/9783642407543

DOI: 10.1007/978-3-642-40754-3_13

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().