کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9502838 | 1339546 | 2005 | 20 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Constructing efficient solutions structure of multiobjective linear programming
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
آنالیز ریاضی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Constructing efficient solutions structure of multiobjective linear programming Constructing efficient solutions structure of multiobjective linear programming](/preview/png/9502838.png)
چکیده انگلیسی
It is not a difficult task to find a weak Pareto or Pareto solution in a multiobjective linear programming (MOLP) problem. The difficulty lies in finding all these solutions and representing their structure. This paper develops an algorithm for solving this problem. We investigate the solutions and their relationships in the objective space. The algorithm determines finite number of weights, each of which corresponds to a weighted sum problems. By solving these problems, we further obtain all weak Pareto and Pareto solutions of the MOLP and their structure in the constraint space. The algorithm avoids the degeneration problem, which is a major hurdle of previous works, and presents an easy and clear solution structure.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Mathematical Analysis and Applications - Volume 307, Issue 2, 15 July 2005, Pages 504-523
Journal: Journal of Mathematical Analysis and Applications - Volume 307, Issue 2, 15 July 2005, Pages 504-523
نویسندگان
Hong Yan, Quanling Wei, Jun Wang,