Implementation of the Simplex Method

Ping-Qi Pan
Additional contact information
Ping-Qi Pan: Southeast University, Department of Mathematics

Chapter Chapter 5 in Linear Programming Computation, 2014, pp 123-141 from Springer

Abstract: Abstract All algorithms formulated in this book, such as the simplex algorithm and the dual simplex algorithm, are theoretical or conceptional, and can not be put to practical use via programming directly. Softwares, resulting by following the algorithms, step by step naively, would only solve textbook instances, involving only few variables and constraints, not real-world problems, especially large-scale sparse problems. Experiences indicate that implementation details are crucial to algorithms’ success (Orchard-Hays 1954; Tomlin 1974; Todd 1982, 1983; Bixby 1994).

Keywords: Large-scale Sparse Problems; Dual Simplex Algorithm; Gaussian Transformation; Nonzero Subdiagonals; Active Submatrix (search for similar items in EconPapers)
Date: 2014
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-3-642-40754-3_5

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

DOI: 10.1007/978-3-642-40754-3_5

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