An algorithm for solving multiple objective integer linear programming problem

被引:5
|
作者
Abbas, M [1 ]
Chaabane, D [1 ]
机构
[1] Fac Math, Dept Rech Operat, El Alia Bab Ezzouar, Alger, Algeria
来源
RAIRO-OPERATIONS RESEARCH | 2002年 / 36卷 / 04期
关键词
multiple objective programming; integer linear programming;
D O I
10.1051/ro:2003006
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In the present paper a complete procedure for solving Multiple Objective Integer Linear Programming Problems is presented. The algorithm can be regarded as a corrected form and an alternative to the method that was proposed by Gupta and Malhotra. A numerical illustration is given to show that this latter can miss some efficient solutions. Whereas, the algorithm stated bellow determines all efficient solutions without missing any one.
引用
收藏
页码:351 / 364
页数:14
相关论文
共 50 条