Abstract.
Efficient, weakly and properly Pareto optimal solutions of multiobjective optimization problems can be characterized with the help of different cones. Here, contingent, tangent and normal cones as well as cones of feasible directions are used in the characterizations. The results are first presented in convex cases and then generalized to nonconvex cases by employing local concepts.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Manuscript received: August 2000/Final version received: October 2000
Rights and permissions
About this article
Cite this article
Miettinen, K., Mäkelä, M. On cone characterizations of weak, proper and Pareto optimality in multiobjective optimization. Mathematical Methods of OR 53, 233–245 (2001). https://doi.org/10.1007/s001860000109
Issue Date:
DOI: https://doi.org/10.1007/s001860000109