Skip to main content
Springer Nature Link
Log in

Existence and characterization of efficient decisions with respect to cones

  • Published:
Mathematical Programming Submit manuscript

Abstract

Existence and characterization theorems for the efficient (nondominated) set of decisions inR n are presented. The existence is proved when the set of decisions satisfies some compactness conditions. The efficient set is characterized in terms of the exposed efficient decisions when certain convexity and compactness conditions are satisfied.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. K.J. Arrow, E.W. Barankin and D. Blackwell, “Admissible points of convex sets”, in: H.W. Kuhn and A.W. Tucker, eds.,Contributions to the theory of games (Princeton University Press, Princeton, NJ, 1953) 87–91.

    Google Scholar 

  2. H.P. Benson, “An improved definition of proper efficiency for vector maximization with respect to cones”,Journal of Mathematical Analysis and Applications 71 (1979) 232–241.

    Google Scholar 

  3. G.R. Bitran and T.L. Magnanti, “The structure of admissible points with respect to cone dominance”,Journal of Optimization Theory and Applications 29 (1979) 573–614.

    Google Scholar 

  4. J.M. Borwein, “The geometry of Pareto efficiency over cones”,Mathematische Operations-forschung und Statistik, Series Optimization 11 (1980) 235–248.

    Google Scholar 

  5. J.M. Borwein, “Proper efficient points for maximization with respect to cones”,SIAM Journal on Control and Optimization 15 (1977) 57–63.

    Google Scholar 

  6. T.A. Brown and R.E. Strauch, “Dynamic programming in multiplicative lattices”,Journal of Mathematical Analysis and Applications 12 (1965) 364–370.

    Google Scholar 

  7. R. Hartley, “On cone-efficiency, cone-convexity, and cone compactness”,SIAM Journal on Applied Mathematics 34 (1978) 211–222.

    Google Scholar 

  8. H.W. Kuhn and A.W. Tucker, “Nonlinear programming”, in: J. Neyman, ed.,Second Berkeley Symposium on Mathematical Statistics and Probability (University of California Press, 1951).

  9. R.T. Rockafellar, Convex analysis (Princeton University Press, Princeton, NJ, 1972).

    Google Scholar 

  10. P.L. Yu, “Cone convexity, cone extreme-points, and nondominated solutions in decisions problems with multi-objectives”,Journal of Optimization Theory Applications 14 (1974) 319–377.

    Google Scholar 

  11. P.L. Yu and M. Zeleney, “The set of all nondominated solutions in linear cases and a multicriteria simplex method”,Journal of Mathematical Analysis Applications 49 (1975) 430–468.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Management, Tel-Aviv University, Tel Aviv, Israel

    Mordechai I. Henig

Authors
  1. Mordechai I. Henig
    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

Henig, M.I. Existence and characterization of efficient decisions with respect to cones. Mathematical Programming 23, 111–116 (1982). https://doi.org/10.1007/BF01583782

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words