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.
Mohamed El‐Amine CherguiMustapha MoulaïFatma Zohra Ouaïl
Subhash C. NarulaVassil Vassilev
Vassil M. VassilevSubhash C. Narula