| Issue |
RAIRO-Oper. Res.
Volume 36, Number 4, October-December 2002
|
|
|---|---|---|
| Page(s) | 351 - 364 | |
| DOI | https://doi.org/10.1051/ro:2003006 | |
| Published online | 15 July 2003 | |
An Algorithm For Solving Multiple Objective Integer Linear Programming Problem
Faculté de Mathématiques,
Département de Recherche Opérationnelle, BP. 32,
El-Alia Bab-Ezzouar, Alger, Algérie;
chaabane_dj@yahoo.fr.
Received:
January
2001
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.
Key words: Multiple objective programming / integer linear programming.
© EDP Sciences, 2002
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.