Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
复制标题
DOI：
10.1016/j.jmaa.2005.06.067
复制
发表时间：
2006-03
影响因子：
1.3
通讯作者：
R. Boț;G. Wanka
中科院分区：
文献类型：
--
作者：
R. Boț;G. Wanka
本文给出了具有凸目标函数和有限多个dc约束的多目标优化问题的对偶理论。为此，我们首先研究了一类由扩展实值凸函数定义的不等式约束的标量凸优化问题的对偶性。对于一类与初始问题相关的多目标问题，利用标量对偶结果确定了它们的多目标对偶问题。最后，我们考虑了具有凸约束的凸多目标优化问题的对偶性。
In this paper we provide a duality theory for multiobjective optimization problems with convex objective functions and finitely many D.C. constraints. In order to do this, we study first the duality for a scalar convex optimization problem with inequality constraints defined by extended real-valued convex functions. For a family of multiobjective problems associated to the initial one we determine then, by means of the scalar duality results, their multiobjective dual problems. Finally, we consider as a special case the duality for the convex multiobjective optimization problem with convex constraints.