Graphical exploration of the weight space in three-objective mixed integer linear programs
From MaRDI portal
Recommendations
- Identifying the Efficient Extreme-Points of the Three-Objective Linear Programming Problem
- A weighted-gradient approach to multi-objective linear programming problems using the analytic hierarchy process
- An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
- An interactive weight space reduction procedure for nonlinear multiple objective mathematical programming
- Some graph optimization problems with weights satisfying linear constraints
- Some graph optimization problems with weights satisfying linear constraints
- Analysis of the objective space in multiple objective linear programming
- An interactive procedure for multiple objective integer linear programming problems
- Solving multiobjective mixed integer convex optimization problems
- Solving multiple objective linear programs in objective space
Cites work
- scientific article; zbMATH DE number 4012303 (Why is no real title available?)
- scientific article; zbMATH DE number 1417900 (Why is no real title available?)
- A New Convex Hull Algorithm for Planar Sets
- A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
- An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- Convex hull of a finite set of points in two dimensions
- Indifference sets of reference points in multi-objective integer linear programming
- Linear Multiparametric Programming by Multicriteria Simplex Method
- The quickhull algorithm for convex hulls
Cited in
(7)- 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
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
- The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems
- Finding multi-objective supported efficient spanning trees
- Weight set decomposition for weighted rank and rating aggregation: an interpretable and visual decision support tool
- An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
This page was built for publication: Graphical exploration of the weight space in three-objective mixed integer linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320624)
