Abstract
In this paper, we study a characterization of weakly efficient solutions of Multiobjective Optimization Problems (MOPs). We 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H.P. Benson, “Finding certain weakly efficient vertices in multiple objective linear fractional programming,”Management Science 31 (2) (1985).
V. Chankong and Y. Haimes,Multiobjective Decision Making: Theory and Methodology (North-Holland, Amsterdam, 1983).
J. Ecker and I. Kouada, “Finding all efficient extreme points for multiple objective linear programs,”Mathematical Programming 14 (1978).
A. Geoffrion, “Proper efficiency and theory of vector maximization,”Journal of Mathematical Analysis and Applications 22 (1968).
Author information
Authors and Affiliations
Additional information
Corresponding author.
Rights and permissions
About this article
Cite this article
Ruíz-Canales, P., Rufián-Lizana, A. A characterization of weakly efficient points. Mathematical Programming 68, 205–212 (1995). https://doi.org/10.1007/BF01585765
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585765