Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming

•Exploits the objective function structure of a multiple objective linear program.•Shows methods for decomposing the criterion cone.•Allows for the computation of all efficient extreme points by distributed processing.•Computational experiments show typical time savings running from 40 to 70%. This...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 277; H. 2; S. 653 - 666
Hauptverfasser:	Piercy, Craig A., Steuer, Ralph E.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.09.2019
Schlagworte:	Criterion cones Distributed processing Efficient extreme points Multiple objective programming Nondominated vertices Efficient extreme points Distributed processing Nondominated vertices Criterion cones Multiple objective programming
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!