A general approach for studying duality in multiobjective optimization

被引：0
|
作者：
Radu Ioan Boţ
Sorin-Mihai Grad
Gert Wanka
机构：
[1] Chemnitz University of Technology,Faculty of Mathematics
来源：
Mathematical Methods of Operations Research | 2007年 / 65卷
关键词：
Multiobjective duality; Efficient solutions (properly, weakly); Fenchel–Lagrange duality; Composed convex optimization problems; 49N15; 90C25; 90C29;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A general duality framework in convex multiobjective optimization is established using the scalarization with K-strongly increasing functions and the conjugate duality for composed convex cone-constrained optimization problems. Other scalarizations used in the literature arise as particular cases and the general duality is specialized for some of them, namely linear scalarization, maximum (-linear) scalarization, set scalarization, (semi)norm scalarization and quadratic scalarization.
引用
收藏
页码：417 / 444
页数：27
相关论文
共 50 条
12345