THE SIMPLEX ALGORITHM

Richard W. Cottle () and Mukund N. Thapa
Additional contact information
Richard W. Cottle: Stanford University
Mukund N. Thapa: Optical Fusion, Inc.

Chapter Chapter 3 in Linear and Nonlinear Optimization, 2017, pp 61-84 from Springer

Abstract: Abstract There are several ways to solve linear programs, but even after its invention in 1947 and the emergence of many new rivals, George B. Dantzig’s Simplex Algorithm stands out as the foremost method of all.

Keywords: Objective Function; Nonlinear Optimization; Canonical Form; Basic Solution; Feasible Region (search for similar items in EconPapers)
Date: 2017
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-4939-7055-1_3

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

DOI: 10.1007/978-1-4939-7055-1_3

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