Skip to main content
SpringerLink
Log in

A class of linear programming problems requiring a large number of iterations

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

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

References

  1. Dantzig, G. B.: Maximization of a linear function of variables subject to linear inequalities. Cowles Commission Monograph No. 13, pp. 339–347. Activity Analysis of Production and Allocation. New York: Wiley 1951.

    Google Scholar 

  2. —: Linear Programming and Extensions. Princeton, N. J.: Princeton Univ. Press 1963.

    Book  MATH  Google Scholar 

  3. Davis, C.: Remarks on a previous paper. Michigan Math. J.2, 23–25 (1953).

    Article  MathSciNet  MATH  Google Scholar 

  4. Goldman, A. J., andD. Kleinman: Examples relating to the simplex method. Operations Res.12, 159–161 (1964).

    Article  MATH  Google Scholar 

  5. Klee, V.: Diameters of polyhedral graphs Canad. J. Math.16, 602–614 (1964).

    Article  MathSciNet  MATH  Google Scholar 

  6. —: On the number of vertices of a convex polytope. Canad. J. Math.16, 701–720 (1964).

    Article  MathSciNet  MATH  Google Scholar 

  7. Klee, V.: Heights of convex polytopes. J. Math. Anal. Appl.11 (1965), to appear.

  8. Klee, V.: Convex polytopes and linear programming. Proceedings of the IBM Scientific Computing Symposium on Combinatorial Problems. New York: International Business Machines Corp. To appear.

  9. Klee, V.: Paths in polyhedra. I. Pacific J. Math. (to appear).

  10. Klee, V.: Paths in polyhedra. II. J. Soc. Ind. Appl. Math. (to appear).

  11. Klee, V., andD. Walkup: Thed-step conjecture for polyhedra of dimensiond<6, to appear.

  12. Kuhn, H., andR. E. Quandt: An experimental study of the simplex method. Proceedings of Symposia in Applied Math., vol. 15, pp. 107–124. Experimental Arithmetic. Providence, R. I.: Amer. Math. Soc. 1963.

    Google Scholar 

  13. Quandt, R. E., andH. Kuhn: On upper bounds for the number of iterations in solving linear programs. Operations Res.12, 161–165 (1964).

    Article  MATH  Google Scholar 

  14. Saaty, T. L.: A conjecture concerning the smallest bound on the iterations in linear programming. Operations Res.11, 151–153 (1963).

    Article  MATH  Google Scholar 

  15. Wolfe, P., andL. Cutler: Experiments in linear programming. Recent Advances in Mathematical Programming, pp. 177–200. New York: McGraw-Hill 1963.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Boeing Scientific Research Laboratories, University of Washington, Seattle 5, Washington, USA

    Victor Klee

Authors
  1. Victor Klee
    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

Klee, V. A class of linear programming problems requiring a large number of iterations. Numer. Math. 7, 313–321 (1965). https://doi.org/10.1007/BF01436525

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation