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

Generalized properly efficient solutions of a vector optimization problem (VP) are defined in terms of various tangent cones and a generalized directional derivative. We study their basic properties and relationships and show that under certain conditions, a generalized properly efficient...

Generalized properly efficient solutions of a vector optimization problem (VP) are defined in terms of various tangent cones and a generalized directional derivative. We study their basic properties and relationships and show that under certain conditions, a generalized properly efficient...

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

A class of scalarizations is studied in order to characterize weakly efficient, efficient and properly efficient points of a non convex vector problem.A parallelism is established between the different solutions of the scalarized problem and the various efficient frontiers.In particular,...