A simplified molp algorithm: The MOLP-S procedure

Leo W.G. Strijbosch, Arno G.M. van Doorne, Willem J. Selen

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)709-716
Number of pages8
JournalComputers and Operations Research
Issue number8
Publication statusPublished - 1991
Externally publishedYes

ASJC Scopus subject areas

  • General Computer Science
  • Modelling and Simulation
  • Management Science and Operations Research


Dive into the research topics of 'A simplified molp algorithm: The MOLP-S procedure'. Together they form a unique fingerprint.

Cite this