کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
480238 | 1446067 | 2012 | 8 صفحه PDF | دانلود رایگان |
In this paper we focus on minimal points in linear spaces and minimal solutions of vector optimization problems, where the preference relation is defined via an improvement set E. To be precise, we extend the notion of E-optimal point due to Chicco et al. in [4] to a general (non-necessarily Pareto) quasi ordered linear space and we study its properties. In particular, we relate the notion of improvement set with other similar concepts of the literature and we characterize it by means of sublevel sets of scalar functions. Moreover, we obtain necessary and sufficient conditions for E-optimal solutions of vector optimization problems through scalarization processes by assuming convexity assumptions and also in the general (nonconvex) case. By applying the obtained results to certain improvement sets we generalize well-known results of the literature referred to efficient, weak efficient and approximate efficient solutions of vector optimization problems.
► Nondominated solutions of convex/nonconvex vector optimization problems are studied.
► The preference relation is defined via an improvement set E.
► The improvement sets are characterized via sublevel sets of scalar functions.
► E-optimality conditions are obtained through scalarization processes.
Journal: European Journal of Operational Research - Volume 223, Issue 2, 1 December 2012, Pages 304–311