Recently, so-called trade-off directions have been introduced for convex multiobjective optimization problems and, later, they have been generalized for nonconvex problems. The trade-off directions are characterized with the help of tangent and contingent cones. Trade-offs give information about...

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...

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...