Skip to main content
SpringerLink
Log in

Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

Although there is no universally accepted solution concept for decision problems with multiple noncommensurable objectives, one would agree that agood solution must not be dominated by the other feasible alternatives. Here, we propose a structure of domination over the objective space and explore the geometry of the set of all nondominated solutions. Two methods for locating the set of all nondominated solutions through ordinary mathematical programming are introduced. In order to achieve our main results, we have introduced the new concepts of cone convexity and cone extreme point, and we have explored their main properties. Some relevant results on polar cones and polyhedral cones are also derived. Throughout the paper, we also pay attention to an important special case of nondominated solutions, that is, Pareto-optimal solutions. The geometry of the set of all Pareto solutions and methods for locating it are also studied. At the end, we provide an example to show how we can locate the set of all nondominated solutions through a derived decomposition theorem.

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.

Similar content being viewed by others

References

  1. Yu, P. L.,The Set of All Nondominated Solutions in Decision Problems with Multiobjectives, University of Rochester, Systems Analysis Program, Working Paper Series, No. F-71-32, 1971.

  2. Luce, R. D., andRaiffa, H.,Games and Decision, John Wiley and Sons, Inc., New York, New York, 1967.

    Google Scholar 

  3. MacGrimmon, K. R.,Decision Making Among Multiple-Attribute Alternatives: A Survey and Consolidated Approach, The RAND Corporation, Memorandum No. RM-4823-ARPA, 1968.

  4. Raiffa, H.,Preferences for Multi-Attributed Alternatives, The RAND Corporation, Memorendum No. RM-5868-DOT/RC, 1969.

  5. DaCunha, N. O., andPolak, E.,Constrained Minimization Under Vector-Valued Criteria in Finite Dimensional Space, Journal of Mathematical Analysis and Applications, Vol. 19, pp. 103–124, 1967.

    Google Scholar 

  6. Ceoffrion, A. M.,Strictly Concave Parametric Programming, Parts I and II, Management Science, Vol. 13, pp. 244–253 and pp. 359–370, 1967.

    Google Scholar 

  7. Geoffrion, A. M.,Solving Bicriterion Mathematical Programs, Operations Research, Vol. 15, pp. 39–54, 1967.

    Google Scholar 

  8. Geoffrion, A. M.,Proper Efficiency and The Theory of Vector Maximization, Journal of Mathematical Analysis and Applications, Vol. 22, pp. 618–630, 1968.

    Google Scholar 

  9. Vincent, T. L., andLeitmann, G.,Control-Space Properties of Cooperative Games, Journal of Optimization Theory and Applications, Vol. 6, pp. 91–113, 1970.

    Google Scholar 

  10. Blackwell, D., andGirshick, M. A.,Theory of Games and Statistical Decisions, John Wiley and Sons, New York, New York, 1954.

    Google Scholar 

  11. Ferguson, T. S.,Mathematical Statistics, A Decision Theoretic Approach, Academic Press, New York, New York, 1967.

    Google Scholar 

  12. Stoer, J., andWitzgall, C.,Convexity and Optimization in Finite Dimensions I, Springer-Verlag, New York, New York, 1970.

    Google Scholar 

  13. Yu, P. L.,A Class of Solutions for Group Decision Problems, Management Science, Vol. 19, pp. 936–946, 1974.

    Google Scholar 

  14. Mangasarian, O. L.,Nonlinear Programming, McGraw-Hill Book Company, New York, New York, 1969.

    Google Scholar 

  15. Leitmann, G., Rocklin, S., andVincent, T. L.,A Note on Control Space Properties of Cooperative Games, Journal of Optimization Theory and Applications, Vol. 9, pp. 379–390, 1972.

    Google Scholar 

  16. Yu, P. L. andZeleny, M.,The Set of All Nondominated Solutions in the Linear Case and a Multicriteria Simplex Method, Journal of Mathematical Analysis and Applications (to appear).

  17. Yu, P. L., andLeitmann, G.,Nondominated Decisions and Cone Convexity in Dynamic Multicriteria Decision Problems, Journal of Optimization Theory and Applications (to appear).

Download references

Author information

Author notes

  1. P. L. Yu (Assistant Professor)

    Present address: Graduate School of Business, University of Texas, Austin, Texas

Authors and Affiliations

  1. Graduate School of Management, University of Rochester, Rochester, New York

    P. L. Yu (Assistant Professor)

Authors
  1. P. L. Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by G. Leitmann

The author would like to thank Professors J. Keilson and M. Zeleny for their helpful discussion and comments. Thanks also go to an anonymous reviewer for his helpful comments concerning the author's previous working paper (Ref. 1). He is especially obliged to Professors M. Freimer and A. Marshall for their careful reading of the first draft and valuable remarks. The author is also very grateful to Professor G. Leitmann and Dr. W. Stadler for their helpful comments.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yu, P.L. Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives. J Optim Theory Appl 14, 319–377 (1974). https://doi.org/10.1007/BF00932614

Download citation

  • Issue Date:

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

Key Words

Search

Navigation