Analysis of the objective space in multiple objective linear programming
From MaRDI portal
Publication:1095043
DOI10.1016/0022-247X(87)90065-5zbMath0631.90071OpenAlexW2042253025MaRDI QIDQ1095043
Publication date: 1987
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(87)90065-5
Related Items (31)
Constructing the set of efficient objective values in linear multiple objective transportation problems ⋮ A Benson-type algorithm for bounded convex vector optimization problems with vertex selection ⋮ Efficient solution generation for multiple objective linear programming based on extreme ray generation method ⋮ A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions ⋮ ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS ⋮ Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming ⋮ Unnamed Item ⋮ Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ Solving multiple-objective problems in the objective space ⋮ A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program ⋮ Linear multicriteria sensitivity and shadow costs ⋮ Constructing the set of efficient objective values in multiple objective linear programs ⋮ Robust multiobjective optimization with application to Internet routing ⋮ Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming ⋮ A representation of the set of feasible objectives in multiple objective linear programs ⋮ Primal and dual algorithms for optimization over the efficient set ⋮ The vector linear program solver Bensolve -- notes on theoretical background ⋮ A parametric simplex algorithm for linear vector optimization problems ⋮ Constructing efficient solutions structure of multiobjective linear programming ⋮ Optimization over the efficient set using an active constraint approach ⋮ Set Optimization—A Rather Short Introduction ⋮ Finding non-dominated solutions in bi-objective integer network flow problems ⋮ Solving multiple objective linear programs in objective space ⋮ Hybrid approach for solving multiple-objective linear programs in outcome space ⋮ A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs ⋮ Outcome space partition of the weight set in multiobjective linear programming ⋮ Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ The maximal descriptor index set for a face of a convex polyhedral set and some applications ⋮ On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program ⋮ A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program ⋮ An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors
Cites Work
- Unnamed Item
- Unnamed Item
- Solving multiple objective linear programs in objective space
- Multiple criteria decision making. Proceedings of a conference, Jouy-en- Josas, France, May 21-23, 1975
- Linear multiobjective programming
- Generating all maximal efficient faces for multiple objective linear programs
- An approach to nonlinear programming
- Finding all efficient extreme points for multiple objective linear programs
- Algorithms for the vector maximization problem
This page was built for publication: Analysis of the objective space in multiple objective linear programming
