Generalizing Reduced Simplex Method

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

Chapter Chapter 19 in Linear Programming Computation, 2014, pp 461-501 from Springer

Abstract: Abstract In Sects. 7.3–7.7, the general LP problem in form (7.11) was converted to the bounded-variable problem (7.13), and the latter was then solved by a generalized primal or dual simplex method. In this chapter, the primal and dual reduced simplex methods will be generalized to solve the bounded-variable problem. Some Phase-I procedures will be developed to provide a starting point to get them started.

Keywords: Bounded-variable Problem; Dual Simplex Method; Dual Feasibility; Basic Optimal Solution; Dual Nondegeneracy (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_19

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

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

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