Volume 20, Issue 1 And 1-2 (IJIEPR 2009)                   IJIEPR 2009, 20(1 And 1-2): 41-51 | Back to browse issues page

XML Print


1- , sjsadjadi@iust.ac.ir
Abstract:   (21357 Views)
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.
Full-Text [PDF 197 kb]   (2726 Downloads)    
Type of Study: Research | Subject: Other Related Subject
Received: 2009/11/29 | Published: 2009/05/15

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.