Conjugate duality for multiobjective composed optimization problems

被引:7
作者
Bot, R. I. [1 ]
Vargyas, E. [1 ]
Wanka, G. [1 ]
机构
[1] Tech Univ Chemnitz, Fac Math, D-09107 Chemnitz, Germany
关键词
composed convex functions; scalar duality; multiobjective duality; optimality conditions;
D O I
10.1007/s10474-007-4273-0
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Given a multiobjective optimization problem with the components of the objective function as well as the constraint functions being composed convex functions, we introduce, by using the Fenchel-Moreau conjugate of the functions involved, a suitable dual problem. Under a standard constraint qualification and some convexity as well as monotonicity conditions we prove the existence of strong duality. Finally, some particular cases of this problem are presented.
引用
收藏
页码:177 / 196
页数:20
相关论文
共 24 条
[1]  
Bot R. I., 2003, MULTICRITERIA FUZZY, P1
[2]   An analysis of some dual problems in multiobjective optimization (I) [J].
Bot, RI ;
Wanka, G .
OPTIMIZATION, 2004, 53 (03) :281-300
[3]  
Bot RI, 2004, OPTIMIZATION, V53, P301, DOI 10.1080/02331930410001715523
[4]   OPTIMALITY CONDITIONS FOR NON-FINITE VALUED CONVEX COMPOSITE FUNCTIONS [J].
BURKE, JV ;
POLIQUIN, RA .
MATHEMATICAL PROGRAMMING, 1992, 57 (01) :103-120
[5]  
Combari C, 1994, Ann. Sci. Math. Quebec, V18, P119
[6]  
Ekeland I., 1976, Convex Analysis and Variational Problems
[7]  
Elster K.-H., 1977, EINFUHRUNG NICHTLINE
[8]  
Goh CJ., 2002, DUALITY OPTIMIZATION