کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6898670 1446114 2010 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
New strong duality results for convex programs with separable constraints
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
New strong duality results for convex programs with separable constraints
چکیده انگلیسی
It is known that convex programming problems with separable inequality constraints do not have duality gaps. However, strong duality may fail for these programs because the dual programs may not attain their maximum. In this paper, we establish conditions characterizing strong duality for convex programs with separable constraints. We also obtain a sub-differential formula characterizing strong duality for convex programs with separable constraints whenever the primal problems attain their minimum. Examples are given to illustrate our results.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 207, Issue 3, 16 December 2010, Pages 1203-1209
نویسندگان
, ,