A simplified molp algorithm: The MOLP-S procedure

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

doi:10.1016/0305-0548(91)90008-F

A simplified molp algorithm: The MOLP-S procedure

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

Research output: Contribution to journal › Article › peer-review

11 Citations (Scopus)

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.

Original language	English
Pages (from-to)	709-716
Number of pages	8
Journal	Computers and Operations Research
Volume	18
Issue number	8
DOIs	https://doi.org/10.1016/0305-0548(91)90008-F
Publication status	Published - 1991
Externally published	Yes

ASJC Scopus subject areas

General Computer Science
Modelling and Simulation
Management Science and Operations Research

Access to Document

10.1016/0305-0548(91)90008-F

Cite this

@article{40c485ec39d844cc8d77fc0827c07bc4,

title = "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.",

author = "Strijbosch, {Leo W.G.} and {van Doorne}, {Arno G.M.} and Selen, {Willem J.}",

year = "1991",

doi = "10.1016/0305-0548(91)90008-F",

language = "English",

volume = "18",

pages = "709--716",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd",

number = "8",

}

TY - JOUR

T1 - A simplified molp algorithm

T2 - The MOLP-S procedure

AU - Strijbosch, Leo W.G.

AU - van Doorne, Arno G.M.

AU - Selen, Willem J.

PY - 1991

Y1 - 1991

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

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

UR - http://www.scopus.com/inward/record.url?scp=0026366377&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026366377&partnerID=8YFLogxK

U2 - 10.1016/0305-0548(91)90008-F

DO - 10.1016/0305-0548(91)90008-F

M3 - Article

AN - SCOPUS:0026366377

SN - 0305-0548

VL - 18

SP - 709

EP - 716

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 8

ER -

A simplified molp algorithm: The MOLP-S procedure

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this