Algorithms

S. Vajda
Additional contact information
S. Vajda: University of Sussex

Chapter Chapter 2 in Linear Programming, 1981, pp 16-49 from Springer

Abstract: Abstract We shall now describe various algorithms for the solution of linear programming problems. We start with the Simplex Method, devised by Dantzig[2]. The name of this method is due to its history, and does not reflect any of its features in applications.

Date: 1981
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:sprchp:978-94-011-6924-0_2

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

DOI: 10.1007/978-94-011-6924-0_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().