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

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 277; číslo 2; s. 653 - 666
Hlavní autori:	Piercy, Craig A., Steuer, Ralph E.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.09.2019
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!