Article ID: | iaor19921161 |
Country: | United Kingdom |
Volume: | 18 |
Start Page Number: | 709 |
End Page Number: | 716 |
Publication Date: | Oct 1991 |
Journal: | Computers and Operations Research |
Authors: | Selen Willem J., Strijbosch Leo W.G., Van Doorne Arno G.M. |
A number of MOLP-algorithms have been developed to establish the set of non-dominated solutions, using a number of different approaches and theorems that may be non-trivial to the non-expert user. This article presents a simplified MOLP-algorithm (MOLP-S), based on a straightforward extension of the simplex-method of linear programming, to trace out the set of non-dominated solutions. The proposed methodology exhibits computational characteristics that may render the method more efficient as compared to other algorithms currently in use. The proposed method is tested on a number of problems from the literature which exhibit varying degrees of complexity.