A New Approach to Solve Multiple Objective Programming Problems
Publish place: International Journal of Industrial Engineering & Production Research، Vol: 20، Issue: 1
Publish Year: 1388
نوع سند: مقاله ژورنالی
زبان: English
View: 628
This Paper With 11 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEPR-20-1_005
تاریخ نمایه سازی: 7 شهریور 1393
Abstract:
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 plaincontinuous 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.
Keywords:
Authors
Mahmood Rezaei Sadrabadi
is a master student in the Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
Seyed Jafar Sadjadi
is a faculty member in the Department of Industrial Engineering, IUST, Tehran, Iran