The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces

作者: XiYin Zheng , XiaoQi Yang

DOI: 10.1007/S11425-008-0021-3

关键词:

摘要: In general normed spaces, we consider a multiobjective piecewise linear optimization problem with the ordering cone being convex and having nonempty interior. We establish that weak Pareto optimal solution set of such is union finitely many polyhedra this also arcwise connected under convexity assumption objective function. Moreover, provide necessary sufficient conditions about existence (sharp) solutions.

参考文章(26)
E. K. Makarov, N. N. Rachkovski, Efficient Sets of Convex Compacta are Arcwise Connected Journal of Optimization Theory and Applications. ,vol. 110, pp. 159- 172 ,(2001) , 10.1023/A:1017599614183
Christiane Tammer, Alfred Göpfert, Theory of Vector Optimization Springer, Boston, MA. pp. 1- 70 ,(2003) , 10.1007/0-306-48107-3_1
B. Jiménez, Strict Minimality Conditions in Nondifferentiable Multiobjective Programming Journal of Optimization Theory and Applications. ,vol. 116, pp. 99- 116 ,(2003) , 10.1023/A:1022162203161
H. P. Benson, E. Sun, Outcome space partition of the weight set in multiobjective linear programming Journal of Optimization Theory and Applications. ,vol. 105, pp. 17- 36 ,(2000) , 10.1023/A:1004605810296
Frank H. Clarke, Optimization and nonsmooth analysis ,(1983)
Boris T Poljak, Introduction to optimization Optimization Software, Publications Division. ,(1987)
L. V. Thuan, D. T. Luc, On sensitivity in linear multiobjective programming Journal of Optimization Theory and Applications. ,vol. 107, pp. 615- 626 ,(2000) , 10.1023/A:1026455401079
X. Y. Zheng, Contractibility and Connectedness of Efficient Point Sets Journal of Optimization Theory and Applications. ,vol. 104, pp. 717- 737 ,(2000) , 10.1023/A:1004649928081
Paul Armand, Finding all maximal efficient faces in multiobjective linear programming Mathematical Programming. ,vol. 61, pp. 357- 375 ,(1993) , 10.1007/BF01582157