A simplified molp algorithm: The MOLP-S procedure

Abstract 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.