| Article ID: | iaor20022009 |
| Country: | Germany |
| Volume: | 53 |
| Issue: | 2 |
| Start Page Number: | 233 |
| End Page Number: | 245 |
| Publication Date: | Jan 2001 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Miettinen K., Mkel M.M. |
Efficient, weakly and properly Pareto optimal solutions of multi-objective 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.