Skip to main content
SpringerLink
Log in

Lexicographic Pivoting Rules

LexPr

  • Reference work entry
Book cover Encyclopedia of Optimization

  • 686 Accesses

Article Outline

Keywords

Lexicographic Simplex Methods

  Lexicographic Ordering

  The Lexicographic Primal Simplex Method

  The Use of Lexicographic Ordering

  Lexicographic Ordering and Perturbation

  Lexicographic Dual Simplex Method

  Extensions

Lexicography and Oriented Matroids

See also

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Anstreicher KM, Terlaky T (1994) A monotonic build-up simplex algorithm. Oper Res 42:556–561

    MathSciNet  MATH  Google Scholar 

  2. Beale EML (1955) Cycling in the dual simplex algorithm. Naval Res Logist Quart 2:269–275

    Article  MathSciNet  Google Scholar 

  3. Bjorner A, Las Vergnas M, Sturmfels B, White N, Ziegler G (1993) Oriented matroids. Cambridge Univ. Press, Cambridge

    Google Scholar 

  4. Charnes A (1952) Optimality and degeneracy in linear programming. Econometrica 20(2):160–170

    Article  MathSciNet  MATH  Google Scholar 

  5. Cottle R, Pang JS, Stone RE (1992) The linear complementarity problem. Acad. Press, New York

    MATH  Google Scholar 

  6. Dantzig GB (1963) Linear programming and extensions. Princeton Univ. Press, Princeton

    MATH  Google Scholar 

  7. Dantzig GB, Orden A, Wolfe P (1955) Notes on linear programming: Part I – The generalized simplex method for minimizing a linear form under linear inequality restrictions. Pacific J Math 5(2):183–195

    MathSciNet  MATH  Google Scholar 

  8. Fukuda K (1982) Oriented matroid programming. PhD Thesis Waterloo Univ.

    Google Scholar 

  9. Hall J, McKinnon KI (1998) A class of cycling counter-examples to the EXPAND anti-cycling procedure. Techn. Report Dept. Math. Statist. Univ. Edinburgh

    Google Scholar 

  10. Hoffman AJ (1953) Cycling in the simplex method. Techn Report Nat Bureau Standards 2974

    Google Scholar 

  11. Lemke CE (1965) Bimatrix equilibrium points and mathematical programming. Managem Sci 11:681–689

    MathSciNet  Google Scholar 

  12. Lemke CE (1968) On complementary pivot theory. In: Dantzig GB, Veinott AF (eds) Mathematics of the Decision Sci. Part I. Lect Appl Math 11. Amer. Math. Soc., Providence, RI, pp 95–114

    Google Scholar 

  13. Lustig I (1987) The equivalence of Dantzig's self-dual parametric algorithm for linear programs to Lemke's algorithm for linear complementarity problems applied to linear programming. SOL Techn Report Dept Oper Res Stanford Univ 87(4)

    Google Scholar 

  14. Terlaky T, Zhang S (1993) Pivot rules for linear programming: A survey on recent theoretical developments. Ann Oper Res 46:203–233

    Article  MathSciNet  Google Scholar 

  15. Todd MJ (1984) Complementarity in oriented matroids. SIAM J Alg Discrete Meth 5:467–485

    Article  MathSciNet  MATH  Google Scholar 

  16. Todd MJ (1985) Linear and quadratic programming in oriented matroids. J Combin Th B 39:105–133

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department Comput. & Software, McMaster University, West Hamilton, Canada

    Tamás Terlaky

Authors
  1. Tamás Terlaky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Terlaky, T. (2008). Lexicographic Pivoting Rules . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_332

Download citation

Publish with us

Policies and ethics

Search

Navigation