Skip to main content
SpringerLink
Log in

A note on maxmin problem

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We consider the maxmin problem which plays an important role in optimization and game theory. We derive new optimality conditions for a local guaranteed solution to the maxmin problem based on Dubovitzkii–Milyuton theory (Dubovitzkii and Milyuton in USSR Comput Math Math Phys 5:1–80, 1965).

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. Kim, D., Pardalos, P.M.: A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems. J. Global Optim. 17(1–4), 225–234 (2000). (Dedicated to the memory of Professor P. D. Panagiotopoulos)

    Article  MathSciNet  MATH  Google Scholar 

  2. Kneser, H.: Sur un théorème fondamental de la théorie des jeux. C. R. Acad. Sci. Paris 234, 2418–2420 (1952)

    MathSciNet  MATH  Google Scholar 

  3. Tseveendorj, I.: Piecewise-convex maximization problems: global optimality conditions. J. Global Optim. 21(1), 1–14 (2001)

    Article  MathSciNet  Google Scholar 

  4. Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization, volume 3 of Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Dordrecht (1995)

    Google Scholar 

  5. Horst, R., Tuy, H.: Global Optimization, 2nd edn. Springer, Berlin (1993). (Deterministic approaches)

    Book  MATH  Google Scholar 

  6. von Neumann, J.: Über ein ökonomisches Gleichungssystem und eine Verallgemeinerung des Brouwerschen Fixpunktsatzes. Ergebn. MathKolloq. Wein 8, 73–83 (1937)

    MATH  Google Scholar 

  7. Floudas, C.A., Pardalos, P.M.: Encyclopedia of Optimization. Springer, Berlin (2008)

    MATH  Google Scholar 

  8. Sion, M.: On general minimax theorems. Pac. J. Math. 8, 171–176 (1958)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ville, J.: Sur la théorie générale des jeux où interviennent l’habilité des joueurs. Traité des probablités et de ses applications 2, 13–42 (1959)

    Google Scholar 

  10. Kakutani, S.: A generalization of Brouwer’s fixed-point theorem. Duka. Math. J. 8, 457–459 (1941)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fan, K.: Fixed-point and minimax theorems in locally convex topological linear space. Proc. Nat. Acad. Sci. USA 8, 412–416 (1956)

    Google Scholar 

  12. Nikaido, L.: On von Neumann’s minimax theorem. Pac. J. Math. 4, 65–72 (1954)

    Article  MathSciNet  MATH  Google Scholar 

  13. Nikaido, L.: One method of proof for the minimax theorem. Proc. Am. Math. Soc. 10, 205–212 (1959)

    Article  MATH  Google Scholar 

  14. Wen-Tsun, W.: A remark on the fundamental theorem in the theory of games. Sci. Rec. (NS) 3, 229–233 (1959)

    MathSciNet  MATH  Google Scholar 

  15. Fan, K.: Minimax theorems. Proc. Nat. Acad. Sci. USA 39, 42–47 (1953)

    Article  MathSciNet  MATH  Google Scholar 

  16. Dem’yanov, V.F., Vasil’ev, L.V.: Nondifferentiable Optimization. Translation Series in Mathematics and Engineering. Publications Division. Optimization Software Inc., New York (1985)

    Google Scholar 

  17. Zǎlinescu, C.: On the maximization of (not necessarily) convex functions on convex sets. J. Global Optim. 36(3), 379–389 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  18. Dubovitzkii, A.Y., Milyuton, A.A.: Extremum problems in presence of restrictions. USSR Comput. Math. Math. Phys. 5, 1–80 (1965)

    Article  Google Scholar 

  19. Strekalovski, A.S., Enkhbat, R.: Optimality conditions for a problem of operations research. J. Discrete Distrib. Syst. Irkutsk 1, 151–159 (1981). (in Russian)

    Google Scholar 

  20. Vasiliev, O.V.: Optimization Methods. World Federation Publisher, New York (1995)

    Google Scholar 

Download references

Acknowledgements

This work was partially supported by the research grant PROF2017-2373 of the National University of Mongolia. The authors are grateful to anonymous referees for their valuable comments and suggestions which greatly improved early version of the paper.

Author information

Authors and Affiliations

  1. Institute of Mathematics, National University of Mongolia, P.O. BOX-46/635, Ulaanbaatar, 210646, Mongolia

    Enkhbat Rentsen & Enkhbayar Jamsranjav

Authors
  1. Enkhbat Rentsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Enkhbayar Jamsranjav
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Enkhbayar Jamsranjav.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rentsen, E., Jamsranjav, E. A note on maxmin problem. Optim Lett 13, 475–483 (2019). https://doi.org/10.1007/s11590-017-1199-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-017-1199-5

Keywords

Search

Navigation