Skip to main content
Log in

On Cone Characterizations of Strong and Lexicographic Optimality in Convex Multiobjective Optimization

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

Abstract

Various type of optimal solutions of multiobjective optimization problems can be characterized by means of different cones. Provided the partial objectives are convex, we derive necessary and sufficient geometrical optimality conditions for strongly efficient and lexicographically optimal solutions by using the contingent, feasible and normal cones. Combining new results with previously known ones, we derive two general schemes reflecting the structural properties and the interconnections of five optimality principles: weak and proper Pareto optimality, efficiency and strong efficiency as well as lexicographic optimality.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chinchuluun, A., Migdalas, A., Pardalos, P.M., Pitsoulis, L. (eds.): Pareto Optimality, Game Theory and Equilibria. Springer, Berlin (2008)

    MATH  Google Scholar 

  2. Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2005)

    MATH  Google Scholar 

  3. Miettinen, K.: Nonlinear Multiobjective Optimization. Kluwer Academic, Boston (1999)

    MATH  Google Scholar 

  4. Henig, M.I.: Proper efficiency with respect to cones. J. Optim. Theory Appl. 36(3), 387–407 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  5. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)

    MATH  Google Scholar 

  6. Miettinen, K., Mäkelä, M.M.: On cone characterizations of weak, proper and Pareto optimality in multiobjective optimization. Math. Methods Oper. Res. 53, 233–245 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. Mäkelä, M.M., Neittaanmäki, P.: Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control. World Scientific, Singapore (1992)

    MATH  Google Scholar 

  8. Rockafellar, R.T.: The Theory of Subgradients and Its Applications to Problems of Optimization. Convex and Nonconvex Functions. Heldermann, Berlin (1981)

    MATH  Google Scholar 

  9. Luc, D.: Theory of Vector Optimization, Lecture Notes in Economics and Mathematical Systems. Springer, New York (1989)

    Google Scholar 

  10. Mishra, S., Giorgio, G.: Invexity and optimization. In: Pardalos, P. (ed.) Nonconvex Optimization and Its Application. Springer, Berlin (2008)

    Google Scholar 

  11. Yuan, D., Liu, X., Chinchuluun, A., Pardalos, P.M.: Optimality conditions and duality for multiobjective programming involving (C; α; ρ; d)-type I functions. In: Konnov, I.V., Luc, D.T., Rubinov, A.M. (eds.) Generalized Convexity and Related Topics, pp. 73–87. Springer, Berlin (2007)

    Google Scholar 

  12. Zhi-An, L., Huang, H.X., Pardalos, P.M.: Efficiency conditions and duality for a class of multiobjective fractional programming problems. J. Glob. Optim. 27(4), 447–471 (2003)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Y. Nikulin.

Additional information

Communicated by P.M. Pardalos.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mäkelä, M.M., Nikulin, Y. On Cone Characterizations of Strong and Lexicographic Optimality in Convex Multiobjective Optimization. J Optim Theory Appl 143, 519–538 (2009). https://doi.org/10.1007/s10957-009-9570-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-009-9570-z

Keywords

Navigation