Convexification of a noninferior frontier

被引:35
作者
Li, D
机构
[1] Dept. of Syst. Eng. and Eng. Mgmt., Chinese University of Hong Kong, Shatin, New Territories
关键词
multiobjective optimization; nonconvex optimization; convexification; noninferior frontier;
D O I
10.1007/BF02192028
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The convexity of a noninferior frontier can be achieved in an appropriate equivalent objective space for general nonconvex multiobjective optimization problems. Specifically, this paper proves that applying the p-power to the objective functions can act as a convexification scheme for a noninferior frontier.
引用
收藏
页码:177 / 196
页数:20
相关论文
共 13 条
[11]   ON THE COMPLETENESS AND CONSTRUCTIVENESS OF PARAMETRIC CHARACTERIZATIONS TO VECTOR OPTIMIZATION PROBLEMS [J].
WIERZBICKI, AP .
OR SPEKTRUM, 1986, 8 (02) :73-87
[12]   Compromise Solutions, Domination Structures, and Salukvadze's Solution [J].
Yu, P. L. ;
Leitmann, G. .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1974, 13 (03) :362-378
[13]  
ZEDEH LA, 1963, IEEE T AUTOMATIC CON, V8, P59