Article Outline
Keywords
Consistent Labeling For the Max-Flow Problem
Linear Optimization
Least-Index Rules for Feasibility Problem
The Linear Optimization Problem
Least-Index Pivoting Methods for LO
Linear Complementarity Problems
Least-Index Rules and Oriented Matroids
See also
References
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Avis D, Chvátal V (1978) Notes on Bland's rule. Math Program Stud 8:24–34
Beale EML (1955) Cycling in the dual simplex algorithm. Naval Res Logist Quart 2:269–275
Bjorner A, Las Vergnas M, Sturmfels B, White N, Ziegler G (1993) Oriented matroids. Cambridge Univ. Press, Cambridge
Bland RG (1977) A combinatorial abstraction of linear programming. J Combin Th B 23:33–57
Bland RG (1977) New finite pivoting rules for the simplex method. Math Oper Res 2:103–107
Chang YY (1979) Least index resolution of degeneracy in linear complementarity problems. Techn Report Dept Oper Res Stanford Univ 79-14
Chang YY, Cottle RW (1980) Least index resolution of degeneracy in quadratic programming. Math Program 18:127–137
Cottle R, Pang JS, Stone RE (1992) The linear complementarity problem. Acad. Press, New York
Dantzig GB (1963) Linear programming and extensions. Princeton Univ. Press, Princeton
Farkas J (1902) Theorie der Einfachen Ungleichungen. J Reine Angew Math 124:1–27
Ford LR Jr, Fulkerson DR (1962) Network flows. Princeton Univ. Press, Princeton
Fukuda K (1982) Oriented matroid programming. PhD Thesis Waterloo Univ.
Fukuda K, Namiki M (1994) On extremal behaviors of Murty's least index method. Math Program 64:365–370
Fukuda K, Terlaky T (1997) Criss-cross methods: A fresh view on pivot algorithms. In: Mathematical Programming, (B) Lectures on Mathematical Programming, ISMP97, vol 79. Lausanne, pp 369–396
Hall J, McKinnon KI (1998) A class of cycling counter-examples to the EXPAND anti-cycling procedure. Techn. Report Dept. Math. and Statist. Univ. Edinburgh
Den Hertog D, Roos C, Terlaky T (1993) The linear complementarity problem, sufficient matrices and the criss-cross method. LAA 187:1–14
Hoffman AJ (1953) Cycling in the simplex method. Techn Report Nat Bureau Standards 2974
Klafszky E, Terlaky T (1989) Variants of the Hungarian method for solving linear programming problems. Math Oper Statist Ser Optim 20:79–91
Klafszky E, Terlaky T (1991) The role of pivoting in proving some fundamental theorems of linear algebra. LAA 151:97–118
Klafszky E, Terlaky T (1992) Some generalizations of the criss-cross method for quadratic programming. Math Oper Statist Ser Optim 24:127–139
Klee V, Minty GJ (1972) How good is the simplex algorithm? In: Shisha O (ed) Inequalities-III. Acad. Press, New York, pp 1159–1175
Murty KG (1974) A note on a Bard type scheme for solving the complementarity problem. Oper Res 11(2–3):123–130
Murty KG (1988) Linear complementarity, linear and nonlinear programming. Heldermann, Berlin
Murty KG (1992) Network programming. Prentice-Hall, Englewood Cliffs, NJ
Roos C (1990) An exponential example for Terlaky's pivoting rule for the criss-cross simplex method. Math Program 46:78–94
Terlaky T (1985) A convergent criss-cross method. Math Oper Statist Ser Optim 16(5):683–690
Terlaky T, Zhang S (1993) Pivot rules for linear programming: A survey on recent theoretical developments. Ann Oper Res 46:203–233
Tucker A (1977) A note on convergence of the Ford–Fulkerson flow algorithm. Math Oper Res 2(2):143–144
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Terlaky, T. (2008). Least-index Anticycling Rules . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_327
Download citation
DOI: https://doi.org/10.1007/978-0-387-74759-0_327
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74758-3
Online ISBN: 978-0-387-74759-0
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering