Logo image
A simplified molp algorithm: The MOLP-S procedure
Journal article   Peer reviewed

A simplified molp algorithm: The MOLP-S procedure

L W G Strijbosch, A G M Van Doorne and Willem Selen
Computers and Operations Research, Vol.18(8), pp.709-716
1991
url
https://doi.org/10.1016/0305-0548(91)90008-FView
Published Version

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. © 1992.

Details

Metrics

4 File views/ downloads
1027 Record Views

InCites Highlights

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Collaboration types
International collaboration
Web Of Science research areas
Computer Science, Interdisciplinary Applications
Engineering, Industrial
Operations Research & Management Science
Logo image