Skip to main content
Log in

Some minimax theorems in vector-valued functions

  • Technical Note
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

In this paper, we generalize the well-known notions of minimax, maximin, and saddle point to vector-valued functions. Conditions for a vector-valued function to have a generalized saddle point are given. An example is used to illustrate the generalized concepts of minimax, maximin, and saddle point.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ponstein, J.,Approaches to the Theory of Optimization, Cambridge University Press, Cambridge, England, 1980.

    Google Scholar 

  2. Rockafellar, R. T.,Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.

    Google Scholar 

  3. Achilles, A., Elster, K. H., andNehse, R.,Bibliographie zur Vektoroptimierung (Theorie und Anwendungen), Mathematische Operationsforschung und Statistik, Series Optimization, Vol. 10, pp. 277–321, 1979.

    Google Scholar 

  4. Hildebrand, W.,Core and Equilibrium of a Large Economy, Princeton University Press, Princeton, New Jersey, 1974.

    Google Scholar 

  5. Bitran, G. R., andMagnanti, T. L.,The Structure of Admissible Points with respect to Cone Dominance, Journal of Optimization Theory and Applications, Vol. 29, pp. 573–614, 1979.

    Google Scholar 

  6. Naccache, P. H.,Connectedness of the Set of Nondominated Outcomes in Multicriteria Optimization, Journal of Optimization Theory and Applications, Vol. 25, pp. 459–467, 1978.

    Google Scholar 

  7. Berge, C.,Topological Spaces, The Macmillan Company, New York, New York, 1963.

    Google Scholar 

  8. Yu, P. L.,Cone Convexity, Cone Extreme Points, and Nondominated Solutions in Decision Problems with Multiobjectives, Journal of Optimization Theory and Applications, Vol. 14, pp. 319–377, 1974.

    Google Scholar 

  9. Arrow, K. J., Barankin, E. W., andBlackwell, D.,Admissible Points of Convex Sets, Contributions to the Theory of Games, Vol. 2, Edited by H. W. Kuhn and A. W. Tucker, Princeton University Press, Princeton, New Jersey, 1953.

    Google Scholar 

  10. Nieuwenhuis, J. W.,Supremal Points and Generalized Duality, Mathematische Operationsforschung und Statistik, Series Optimization, Vol. 11, pp. 41–59, 1980.

    Google Scholar 

  11. Rödder, W.,A Generalized Saddle-Point Theory as Applied to Duality Theory for Linear Vector Optimization Problems, European Journal of Operations Research, Vol. 1, pp. 55–59, 1977.

    Google Scholar 

  12. Hartley, R.,On Cone-Efficiency, Cone-Convexity, and Cone-Compactness, SIAM Journal on Applied Mathematics, Vol. 34, pp. 211–222, 1978.

    Google Scholar 

  13. Blackwell, D.,An Analog of the Minimax Theorem for Vector Payoffs, Pacific Journal of Mathematics, Vol. 6, pp. 1–8, 1955.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by P. L. Yu

The author would like to thank the referees for their valuable comments.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nieuwenhuis, J.W. Some minimax theorems in vector-valued functions. J Optim Theory Appl 40, 463–475 (1983). https://doi.org/10.1007/BF00933511

Download citation

  • Issue Date:

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

Key Words

Navigation