کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
478559 | 1446106 | 2011 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On duality in multiple objective linear programming
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: On duality in multiple objective linear programming On duality in multiple objective linear programming](/preview/png/478559.png)
چکیده انگلیسی
In this paper we present two approaches to duality in multiple objective linear programming. The first approach is based on a duality relation between maximal elements of a set and minimal elements of its complement. It offers a general duality scheme which unifies a number of known dual constructions and improves several existing duality relations. The second approach utilizes polarity between a convex polyhedral set and the epigraph of its support function. It leads to a parametric dual problem and yields strong duality relations, including those of geometric duality.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 210, Issue 2, 16 April 2011, Pages 158–168
Journal: European Journal of Operational Research - Volume 210, Issue 2, 16 April 2011, Pages 158–168
نویسندگان
Dinh The Luc,