THE SIMPLEX ALGORITHM CONTINUED

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

Chapter Chapter 4 in Linear and Nonlinear Optimization, 2017, pp 85-116 from Springer

Abstract: Abstract The discussion of the Simplex Algorithm for linear programming presented in the previous chapter included two crucial assumptions. The first was that a starting basic feasible solution was known and, moreover, that the system was in canonical form with respect to this feasible basis.

Keywords: Basic Variable; Simplex Algorithm; Price Vector; Basic Feasible Solution; Pivot Step (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_4

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

DOI: 10.1007/978-1-4939-7055-1_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 ().