Criss-Cross Simplex Method

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

Chapter Chapter 18 in Linear Programming Computation, 2014, pp 441-460 from Springer

Abstract: Abstract Methods perform very differently when solving a same problem. It is common that a problem that is solved slowly by the simplex method would be solved fast by the dual simplex method; and vise versa. Consequently, LP packages often include multiple options to be chosen, as it seems to be impossible to predetermine which method would be better to solve a given problem. Pursuing a method with features of both the primal and dual methods, scholars have attempted to combine primal and dual simplex methods for years. A class of resulting variants may be described by “criss-cross” because of their switching between primal and dual iterations. The primal-dual algorithm (Sect. 7.1) and the self-dual parametric simplex algorithm (Sect. 7.2) may be also classified into this category.

Keywords: Dual Iterations; Dual Simplex; Simplex Algorithm; Criss-cross Method; Minimum Ratio Test (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_18

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

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

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