جلد 20، شماره 1 و 1-2 - ( 2-1388 )                   جلد 20 شماره 1 و 1-2 صفحات 41-51 | برگشت به فهرست نسخه ها


XML English Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Rezaei Sadrabadi M, Sadjadi S J. A New Approach to Solve Multiple Objective Programming Problems. IJIEPR. 2009; 20 (1 and 1-2) :41-51
URL: http://ijiepr.iust.ac.ir/article-1-53-fa.html
A New Approach to Solve Multiple Objective Programming Problems. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1388; 20 (1 و 1-2) :41-51

URL: http://ijiepr.iust.ac.ir/article-1-53-fa.html


چکیده:   (17075 مشاهده)
Multiple Objective Programming (MOP) problems have become famous among many researchers due to more practical and realistic implementations. There have been a lot of methods proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP problems by starting from a utopian point (which is usually infeasible) and moving towards the feasible region via stepwise movements and a plain continuous interaction with Decision Maker (DM). We consider the case where all objective functions and constraints are linear. The implementation of the proposed algorithm is demonstrated with two numerical examples.
متن کامل [PDF 197 kb]   (1369 دریافت)    
نوع مطالعه: پژوهشي | موضوع مقاله: و موضوعات مربوط
دریافت: ۱۳۸۸/۹/۸

ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
کد امنیتی را در کادر بنویسید

کلیه حقوق این وب سایت متعلق به نشریه بین المللی مهندسی صنایع و تحقیقات تولید می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2015 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb