Skip to main content
SpringerLink
Log in

Linear programming, the simplex algorithm and simple polytopes

  • Published:
Mathematical Programming Submit manuscript

Abstract

In the first part of the paper we survey some far-reaching applications of the basic facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concerning the simplex algorithm. We describe subexponential randomized pivot rules and upper bounds on the diameter of graphs of polytopes. © 1997 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N. Amenta and G. Ziegler, Deformed products and maximal shadows, Preprint 502/1996, TU Berlin, to appear.

  2. L.J. Billera and C.W. Lee, A proof of the sufficiency of McMullen’s conditions forf-vectors of simplicial convex polytopes,J. Combin. Theory, Series A 31 (1981) 237–255.

    Article  MATH  MathSciNet  Google Scholar 

  3. R. Blind and P. Mani, On puzzles and polytope isomorphism,Aequationes Math. 34 (1987) 287–297.

    Article  MATH  MathSciNet  Google Scholar 

  4. K. H. Borgwardt,The Simplex Method, A Probabilistic Analysis, Algorithms and Combinatorics, Vol 1 (Springer, Berlin, 1987).

    Google Scholar 

  5. K.L. Clarkson, A Las Vegas Algorithm for linear programming when the dimension is small.J. ACM 42 (2) (1995) 488–499.

    Article  MATH  MathSciNet  Google Scholar 

  6. G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963).

    MATH  Google Scholar 

  7. M.E. Dyer and A. Frieze, Random walks, totally unimodular matrices and a randomized dual simplex algorithm,Mathematical Programming 64 (1994) 1–16.

    Article  MathSciNet  Google Scholar 

  8. B. Gärtner, A subexponential algorithm for abstract optimization problems,SIAM J. Comput. 24 (1995) 1018–1035

    Article  MATH  MathSciNet  Google Scholar 

  9. B. Gärtner, M. Henk and G. Ziegler, Randomized simplex algorithms on Klee-Minty cubes, to appear.

  10. B. Grünbaum,Convex Polytopes (Interscience, London, 1967).

    MATH  Google Scholar 

  11. F. Holt and V. Klee, Many polytopes meeting the conjectured Hirsch bound, (1997), to appear.

  12. L.G. Khachiyan, A polynomial algorithm in linear programming,Soviet Math. Doklady 20 (1979) 191–194.

    MATH  Google Scholar 

  13. G. Kalai, A simple way to tell a simple polytope from its graph, J. Combin. Theory, Series A 49 (1988) 381–383.

    Article  MATH  MathSciNet  Google Scholar 

  14. G. Kalai, The diameter of graphs of convex polytopes andf-vector theory, in:Applied Geometry and Discrete Mathematics, The Klee Festschrift, DIMACS Series in Discrete Mathematics and Computer Science, Vol. 4 (1991) 387–411.

    MathSciNet  Google Scholar 

  15. G. Kalai, Upper bounds for the diameter of graphs of convex polytopes,Discrete Computational Geometry 8 (1992) 363–372.

    Article  MATH  MathSciNet  Google Scholar 

  16. G. Kalai, A subexponential randomized simplex algorithm, in:Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (ACM Press, Victoria, 1992) 475–482.

    Google Scholar 

  17. G. Kalai and D. J. Kleitman, A quasi-polynomial bound for diameter of graphs of polyhedra,Bull. Amer. Math. Soc. 26 (1992) 315–316.

    MATH  MathSciNet  Google Scholar 

  18. V. Klee and G.J. Minty, How good is the simplex algorithm, in: O. Shisha, ed.,Inequalities III (Academic Press, New York, 1972) 159–175.

    Google Scholar 

  19. V. Klee and D. Walkup, Thed-step conjecture for polyhedra of dimensiond < 6,Acta Math. 133, pp. 53–78.

  20. D.G. Larman, Paths on polytopes,Proc. London Math. Soc. 20 (1970) 161–178.

    Article  MATH  MathSciNet  Google Scholar 

  21. J. Matoušek, Lower bounds for a subexponential optimization algorithm,Random Structures and Algorithms 5 (1994) 591–607.

    MathSciNet  MATH  Google Scholar 

  22. J. Matoušek, M. Sharir and E. Welzl, A subexponential bound for linear programming, in:Proceedings of the 8th Annual Symposium on Computational Geometry (1992) 1–8.

  23. P. McMullen, The maximal number of faces of a convex polytope,Mathematika 17 (1970) 179–184.

    Article  MathSciNet  MATH  Google Scholar 

  24. P. McMullen, On simple polytopes,Inven. Math. 113 (1993) 419–444.

    Article  MATH  MathSciNet  Google Scholar 

  25. N. Megiddo, Linear programming in linear time when the dimension is fixed,J. ACM 31 (1984) 114–127.

    Article  MATH  MathSciNet  Google Scholar 

  26. K. Mulmuley,Computational Geometry, An Introduction Through Randomized Algorithms (Prentice-Hall, Englewoods Cliffs, NJ, 1994).

    Google Scholar 

  27. M. Sharir and E. Welzl, A Combinatorial bound for linear programming and related problems,Proceedings of the 9th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 577 (Springer, Berlin, 1992) 569–579.

    Google Scholar 

  28. R. Seidel, Small-dimensional linear programming and convex hulls made easy,Discrete Computational Geometry 6 (1991) 423–434.

    Article  MATH  MathSciNet  Google Scholar 

  29. A. Schrijver,Theory of Linear and Integer Programming (Wiley-Interscience, New York, 1986).

    MATH  Google Scholar 

  30. R. Stanley, The number of faces of simplicial convex polytopes, it Adv. Math. 35 (1980) 236–238.

    Article  MATH  MathSciNet  Google Scholar 

  31. E. Tardos, A strongly polynomial algorithm to solve combinatorial linear programs,Operations Research 34 (1986) 250–256.

    Article  MATH  MathSciNet  Google Scholar 

  32. G.M. Ziegler,Lectures on Polytopes, Graduate Texts in Mathematics, Vol. 152 (Springer, New York, 1995).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Hebrew University of Jerusalem, Jerusalem, Israel

    Gil Kalai

Authors
  1. Gil Kalai
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kalai, G. Linear programming, the simplex algorithm and simple polytopes. Mathematical Programming 79, 217–233 (1997). https://doi.org/10.1007/BF02614318

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02614318

Keywords

Search

Navigation