A characterization of weakly efficient points

In this paper, the authors study a characterization of weakly efficient solutions of Multiobjective Optimalization Problems (MOPs). They find that, under some quasiconvex conditions of the objective functions in a convex set of constraints, weakly efficient solutions of an MOP can be characterized as an optimal solution to a scalar constraint problem, in which one of the objectives is optimized and the remaining objectives are set up as constraints. This characterization is much less restrictive than those found in the literature up to now.