Skip to main content
SpringerLink
Log in

Bottleneck linear programming

  • Published:
Mathematical Programming Submit manuscript

Abstract

The Bottleneck Linear Programming problem (BLP) is to maximizex 0 = max j c j ,x j > 0 subject toAx = b, x ⩾ 0. A relationship between the BLP and a problem solvable by a “greedy” algorithm is established. Two algorithms for the BLP are developed and computational experience is reported.

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. A. Ducamp, “Un problème d'affectation”,Cahiers du Centre d'Etudes de Recherche Opérationnelle 8 (1966) 69–72.

    Google Scholar 

  2. J. Edmonds, “Matroids and the greedy algorithm”,Mathematical Programming 1, (1971) 127–36.

    Google Scholar 

  3. J. Edmonds and D. R. Fulkerson, “Bottleneck extrema”,Journal of Combinatorial Theory 8 (1970) 299–306.

    Google Scholar 

  4. R.L. Francis and J.A. White,Facility layout and location; an analytical approach (Prentice Hall, Englewood Cliffs, N.J. 1974).

    Google Scholar 

  5. R.S. Garfinkel, “An improved algorithm for the bottleneck assignment problem”,Operations Research 19 (1971) 1747–51.

    Google Scholar 

  6. R.S. Garfinkel, A.W. Neebe and M.R. Rao, “Them-center problem: bottleneck facility location”, Working Paper Series No. 7414, Graduate School of Management, University of Rochester, Rochester, New York.

  7. R.S. Garfinkel and G.L. Nemhauser, “Optimal political districting by implicit enumeration techniques”,Management Science 16B (1970) 495–508.

    Google Scholar 

  8. R.S. Garfinkel and M.R. Rao, “The bottleneck transportation problem”,Naval Research Logistics Quarterly 18 (1971) 465–72.

    Google Scholar 

  9. R.S. Garfinkel and P.L. Yu, “A primal-dual surrogate simplex algorithm: comparison with the criss-cross method”, CSS 73-12, Graduate School of Management, University of Rochester, New York (November 1973).

    Google Scholar 

  10. O. Gross, “The bottleneck assignment problem”, The Rand Corporation, pp. 1630 (1959).

  11. P.L. Hammer, “Time-minimizing transportation problems”,Naval Research Logistics Quarterly 16 (1969) 345–57.

    Google Scholar 

  12. W. Szwarc, “Some remarks on the time transportation problem”,Naval Research Logistics Quarterly 18 (1971) 473–485.

    Google Scholar 

  13. P. Wolfe, “The composite simplex algorithm”,SIAM Review 7 (1965) 42–54.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Tennessee, Knoxville, Tenn., USA

    Robert S. Garfinkel

  2. The University of Rochester, N.Y., USA

    Mendu Rao

Authors
  1. Robert S. Garfinkel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mendu Rao
    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

Garfinkel, R.S., Rao, M. Bottleneck linear programming. Mathematical Programming 11, 291–298 (1976). https://doi.org/10.1007/BF01580397

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation