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


XML 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-en.html

, sjsadjadi@iust.ac.ir
Abstract:   (17076 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]   (1370 Downloads)    
Type of Study: Research | Subject: Other Related Subject
Received: 2009/11/29

Add your comments about this article : Your username or email:
Write the security code in the box

Send email to the article author


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

Designed & Developed by : Yektaweb