Skip to main content
SpringerLink
Log in

Linear Programming: Klee–Minty Examples

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Introduction

Simplex Algorithm

Klee–Minty Examples

Applications

  Smallest Index Rule

  Largest Coefficient Rule

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. Avis D, Chvátal V (1978) Notes on Bland's pivoting rule. Math Program Stud 8:24–34

    Google Scholar 

  2. Bland RG (1977) New finite pivoting rules for the simplex method. Math Oper Res 2:103–107

    MathSciNet  MATH  Google Scholar 

  3. Chen H, Pardalos PM, Saunders MA (1994) The simplex algorithm with a new primal and dual pivot rule. Oper Res Lett 16:121–127

    Article  MathSciNet  MATH  Google Scholar 

  4. Chvátal V (1983) Linear programming. Freeman, New York

    MATH  Google Scholar 

  5. Dantzig GB (1963) Linear programming and extentions. Princeton Univ. Press, Princeton

    Google Scholar 

  6. Dosios K, Paparrizos K (1996) Resolution of the problem of degeneracy in a primal and dual simplex algorithm. Oper Res Lett 20:45–50

    Article  MathSciNet  Google Scholar 

  7. Goldfarb D, Sit W (1979) Worst case behavior of the steepest edge simplex method. Discrete Appl Math 1:277–285

    Article  MathSciNet  MATH  Google Scholar 

  8. Jeroslow RG (1973) The simplex algorithm with the pivot rule of maximizing improvement criterion. Discret Math 4:367–377

    Article  MathSciNet  MATH  Google Scholar 

  9. Klee V, Minty GJ (1972) How good is the simplex algorithm? In: Shisha O (ed) Inequalities: III. Acad. Press, New York

    Google Scholar 

  10. Murty KG (1983) Linear programming. Wiley, New York

    MATH  Google Scholar 

  11. Paparrizos K (1989) Pivoting rules directing the simplex method through all feasible vertices of Klee–Minty examples. Opsearch 26(2):77–95

    MathSciNet  MATH  Google Scholar 

  12. Paparrizos K (1993) An exterior point simplex algorithm for (general) linear programming problems. Ann Oper Res 47:497–508

    Article  MathSciNet  Google Scholar 

  13. Roos C (1990) An exponential example for Terlaky's pivoting rule for the criss - cross simplex method. Math Program 46:78–94

    Article  MathSciNet  Google Scholar 

  14. Terlaky T (1985) A convergent criss - cross method. Math Oper Statist Ser Optim 16:683–690

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department Applied Informatics, University Macedonia, Thessaloniki, Greece

    Konstantinos Paparrizos & Nikolaos Samaras

  2. Department Business Admin., Techn. Institute West Macedonia, Kozani, Greece

    Dimitrios Zissopoulos

Authors
  1. Konstantinos Paparrizos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nikolaos Samaras
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dimitrios Zissopoulos
    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

Paparrizos, K., Samaras, N., Zissopoulos, D. (2008). Linear Programming: Klee–Minty Examples . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_339

Download citation

Publish with us

Policies and ethics

Search

Navigation