Skip to main content
SpringerLink
Log in

A linear max—min problem

  • Published:
Mathematical Programming Submit manuscript

Abstract

We consider a two person max—min problem in which the maximizing player moves first and the minimizing player has perfect information of the outcome of this move. The move of the maximizing player influences not only the objective function but also the constraints of the minimizing player. The joint constraints as well as the objective function are assumed to be linear.

For this problem it is shown that the familiar inequality min max ⩾ max min is reversed due to the influence of the joint constraints. The problem is characterized as a nonconvex program and a method of solution based on the branch and bound philosophy is given. A small example is presented to illlustrate the algorithm.

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. M. Balinski, “An algorithm for finding all vertices of a convex polyhedral set”,SIAM Journal 9 (1) (1961) 72–88.

    Google Scholar 

  2. C.A. Burdet, “Deux modèles de minimisation d'une fonction économique concave”, R.I.R.O. No. V-1-1970 (1970) 79–84.

  3. A.V. Cabot, “Variations on a cutting plane method for solving concave minimization problems with linear constraints”, Indiana University (1972).

  4. J.M. Danskin,The theory of max—min (Springer, Berlin, 1967).

    Google Scholar 

  5. H. Konno, “Bilinear programming: Part I. Algorithm for solving bilinear programs”, Technical Report No. 71-9, Operations Research House, Stanford, Calif. (1971).

    Google Scholar 

  6. H. Konno, “Bilinear programming: Part II. Applications of bilinear programming”, Technical Report No. 71-10, Operations Research House, Stanford, Calif. (1971).

    Google Scholar 

  7. R.T. Rockafellar,Convex analysis (Princeton University Press, Princeton, N.J., 1970).

    Google Scholar 

  8. H. Tuy, “Concave programming under linear constraints”,Soviet Mathematics, Doklady 5 (6) (1964).

Download references

Author information

Authors and Affiliations

  1. The George Washington University, Washington, D.C., USA

    James E. Falk

Authors
  1. James E. Falk
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Support of this work has been provided by the Office of Naval Research Contract N00014-67-A-0214, Task 0001, Project NR 347 020, and by the Department of the Army Contract DAHC 19-69-C-0017.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Falk, J.E. A linear max—min problem. Mathematical Programming 5, 169–188 (1973). https://doi.org/10.1007/BF01580119

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation