Article ID: | iaor20053321 |
Country: | France |
Volume: | 36 |
Issue: | 4 |
Start Page Number: | 351 |
End Page Number: | 364 |
Publication Date: | Oct 2002 |
Journal: | RAIRO Operations Research |
Authors: | Abbas Moncef, Chaabane Djamal |
Keywords: | programming: integer |
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 below determines all efficient solutions without missing any one.