A New Interactive Method to Solve Multiobjective Linear Programming Problems

HTML  Download Download as PDF (Size: 297KB)  PP. 237-247  
DOI: 10.4236/jsea.2009.24031    7,086 Downloads   13,976 Views  Citations

Affiliation(s)

.

ABSTRACT

Multiobjective Programming (MOP) has become famous among many researchers due to more practical and realistic applications. A lot of methods have been proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP by starting from a utopian point, which is usually infeasible, and moving towards the feasible region via stepwise movements and a simple continuous interaction with decision maker. We consider the case where all objective functions and constraints are linear. The implementation of the pro-posed algorithm is demonstrated by two numerical examples.

Share and Cite:

M. REZAEI SADRABADI and S. SADJADI, "A New Interactive Method to Solve Multiobjective Linear Programming Problems," Journal of Software Engineering and Applications, Vol. 2 No. 4, 2009, pp. 237-247. doi: 10.4236/jsea.2009.24031.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.