Solving multiple objective linear programs in objective space

DOI10.1016/0377-2217(90)90010-9zbMath0712.90063OpenAlexW2082143163MaRDI QIDQ749446

Yi-Hsin Liu, Jerald P. Dauer

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90010-9

zbMATH Keywords

nondominated extreme points

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (21)

A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions ⋮ Analysis of the objective space in multiple objective linear programming ⋮ 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 new exact method for linear bilevel problems with multiple objective functions at the lower level ⋮ Constructing the set of efficient objective values in multiple objective linear programs ⋮ The vector linear program solver Bensolve -- notes on theoretical background ⋮ A parametric simplex algorithm for linear vector optimization problems ⋮ Optimization over the efficient set using an active constraint approach ⋮ Set Optimization—A Rather Short Introduction ⋮ 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 ⋮ 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 ⋮ Enumerating extreme points of a highly degenerate polytope

Cites Work

• Analysis of the objective space in multiple objective linear programming
• A multiobjective optimization model for water resources planning
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Linear multiobjective programming
• Redundant objective functions in linear vector maximum problems and their determination
• Generating all maximal efficient faces for multiple objective linear programs
• An approach to nonlinear programming
• The range of the efficient frontier in multiple objective linear programming
• Finding all efficient extreme points for multiple objective linear programs
• Algorithms for the vector maximization problem
• Algorithms for frames and lineality spaces of cones
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving multiple objective linear programs in objective space