The Simplex Method, Part 2

Eric V. Denardo ()
Additional contact information
Eric V. Denardo: Yale University

Chapter Chapter 6 in Linear Programming and Generalizations, 2011, pp 195-218 from Springer

Abstract: Abstract This chapter completes this book’s introductory account of the simplex method. In this chapter, you will see: How Phase I of the simplex method determines whether a linear program has a feasible solution and, if so, how it constructs a basic feasible tableau with which to initiate Phase II. That the simplex method can “cycle” (fail to terminate finitely) and that it can be kept from doing so. That the simplex method readily accommodates variables that are not required to be nonnegative.

Keywords: Free Variable; Simplex Method; Basic Feasible Solution; Ellipsoid Method; Nonbasic Variable (search for similar items in EconPapers)
Date: 2011
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:isochp:978-1-4419-6491-5_6

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

DOI: 10.1007/978-1-4419-6491-5_6

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().