An Algorithm for Solving Multicriterion Linear Programming Problems with Examples

作者: Sheldon M. Belenson , Kailash C. Kapur

DOI: 10.1057/JORS.1973.9

关键词:

摘要: The purpose of this paper is to develop a useful technique for solving linear programmes involving more than one objective function. Motivation multicriterion given along with the inherent difficulty associated obtaining satisfactory solution set. By applying programming approach two person–zero sum games mixed strategies, it shown that optimization problem multiple functions can be formulated in fashion order obtain set satisfying all requirements an efficient problem. method then refined take into account disparities between magnitude values generated by each and preferences as determined decision-maker. A summary several examples demonstrate its applicability.

参考文章(6)
Arthur M. Geoffrion, Solving Bicriterion Mathematical Programs Operations Research. ,vol. 15, pp. 39- 54 ,(1967) , 10.1287/OPRE.15.1.39
B. Roy, Problems and methods with multiple objective functions Mathematical Programming. ,vol. 1, pp. 239- 266 ,(1971) , 10.1007/BF01584088
Kailash C. Kapur, Mathematical methods of optimization for multi-objective transportation systems Socio-economic Planning Sciences. ,vol. 4, pp. 451- 467 ,(1970) , 10.1016/0038-0121(70)90020-0
R. Benayoun, J. de Montgolfier, J. Tergny, O. Laritchev, Linear programming with multiple objective functions: Step method (stem) Mathematical Programming. ,vol. 1, pp. 366- 375 ,(1971) , 10.1007/BF01584098
Arthur M Geoffrion, Proper efficiency and the theory of vector maximization Journal of Mathematical Analysis and Applications. ,vol. 22, pp. 618- 630 ,(1968) , 10.1016/0022-247X(68)90201-1
Gerald J. Lieberman, Frederick Stanton Hillier, Introduction to Operations Research ,(1967)