The Dual Simplex Pivot and Its Uses

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

Chapter Chapter 13 in Linear Programming and Generalizations, 2011, pp 413-441 from Springer

Abstract: Abstract The simplex method pivots to preserve feasibility and seek optimality (nonpositive reduced costs in a maximization problem). By contrast, the “dual” simplex method pivots to preserve optimality and seek feasibility.

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_13

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

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

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