Graphical exploration of the weight space in three-objective mixed integer linear programs

DOI10.1016/j.ejor.2015.06.072zbMath1346.90622OpenAlexW2179950587WikidataQ57664283 ScholiaQ57664283MaRDI QIDQ320624

Maria João Alves, João Paulo Costa

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.06.072

zbMATH Keywords

mixed integer linear programmingmultiple objective programmingweighted-sum scalarizationextreme supported nondominated solutionsweight space

Mathematics Subject Classification ID

Mixed integer programming (90C11) Multi-objective and goal programming (90C29)

Related Items (6)

SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems ⋮ Weight set decomposition for weighted rank and rating aggregation: an interpretable and visual decision support tool ⋮ Finding multi-objective supported efficient spanning trees ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs ⋮ An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem

Uses Software

• Qhull

Cites Work

• Unnamed Item
• Unnamed Item
• Convex hull of a finite set of points in two dimensions
• An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
• A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
• A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
• An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
• Linear Multiparametric Programming by Multicriteria Simplex Method
• A New Convex Hull Algorithm for Planar Sets
• Indifference sets of reference points in multi-objective integer linear programming
• The quickhull algorithm for convex hulls

This page was built for publication: Graphical exploration of the weight space in three-objective mixed integer linear programs