The Simplex Method, Part 1

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

Chapter Chapter 4 in Linear Programming and Generalizations, 2011, pp 113-152 from Springer

Abstract: Abstract The simplex method is the principal tool for computing solutions to linear programs. Computer codes that execute the simplex method are widely available, and they run on nearly every computer. You can solve linear programs without knowing how the simplex method works. Why should you learn it? Three reasons are listed below:

Keywords: Extreme Point; Basic Solution; Feasible Region; Basic Variable; Simplex Method (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_4

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

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

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 ().