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

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 277; no. 2; pp. 653 - 666
Main Authors:	Piercy, Craig A., Steuer, Ralph E.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.09.2019
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!