Research ArticleOpen AccessGoogle Scholar indexed
A New Interactive Method to Solve Multiobjective Linear Programming Problems
- 1
- 2
Journal of Software Engineering and Applications·Volume 02 (2009)·Pages 237–247·Published 27 November 2009·DOI10.4236/jsea.2009.24031
Copy link · social · email
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.
KeywordsMultiobjective Linear ProgrammingMultiobjective Decision MakingInteractive Methods
- F. B. Abdelaziz, “Multiple objective programming and goal programming: New trends and applications,” Euro-pean Journal of Operational Research, Vol. 177, pp. 1520–1522, 2007.
- M. M. Wiecek, “Multiple criteria decision making for engineering,” Omega, Vol. 36, pp. 337–339, 2008.
- J. Kim and S. K. Kim, “A CHIM-based interactive Tche-bycheff procedure for multiple objective decision mak-ing,” Computers & Operations Research, Vol. 33, pp. 1557–1574, 2006.
- M. Sun, “Some issues in measuring and reporting solu-tion quality of interactive multiple objective programming procedures,” European Journal of Operational Research, Vol. 162, pp. 468–483, 2005.
- M. Zeleny, “Multiple criteria decision making,” MC Graw-Hill, New York, 1982.
- R. Kenney and H. Raiffa, “Decisions with multiple objec-tives: Preferences and value trade-offs,” J. Wiley, New York, 1976.
- C. Romero, “Handbook of critical issues in goal pro-gramming,” Pergamon Press, Oxford, 1991.
- M. Ida, “Efficient solution generation for multiple objec-tive linear programming based on extreme ray generation method,” European Journal of Operational Research, Vol. 160, pp. 242–251, 2005.
- L. Pourkarimi, M. A. Yaghoobi and M. Mashinchi, “De-termining maximal efficient faces in multiobjective linear programming problem,” Journal of Mathematical Analy-sis and Applications, Vol. 354, pp. 234–248, 2009.
- R. E. Steuer and C. A. Piercy, “A regression study of the number of efficient extreme points in multiple objective linear programming,” European Journal of Operational Research, Vol. 162, pp. 484–496, 2005.
- E. A. Youness and T. Emam, “Characterization of effi-cient solutions for multi-objective optimization problems involving semi-strong and generalized semi-strong e-convexity,” Acta Mathematica Scientia, Vol. 28B(1), pp. 7–16, 2008.
- S. I. Gass and P. G. Roy, “The compromise hypersphere for multiobjective linear programming,” European Jour-nal of Operational Research, Vol. 144, pp. 459–479, 2003.
- J. Chen and S. Lin, “An interactive neural network-based approach for solving multiple criteria decision making problems,” Decision Support Systems, Vol. 36, pp. 137–146, 2003.
- A. Engau, “Tradeoff-based decomposition and deci-sion-making in multiobjective programming,” European Journal of Operational Research, Vol. 199, pp. 883–891, 2009.