Analysis of the objective space in multiple objective linear programming
From MaRDI portal
A multiple objective linear program is defined by a matrix C consisting of the coefficients of the linear objectives and a convex polytope X defined by the linear constraints. An analysis of the objective space \(Y=C[X]\) for this problem is presented. A characterization between a face of Y and the corresponding faces of X is obtained. This result gives a necessary and sufficient condition for a face to be efficient. The theory and examples demonstrate the collapsing (simplification) that occurs in mapping X to Y. These results form a basis for a new approach to analyzing multiple objective linear programs.
Recommendations
- scientific article; zbMATH DE number 3889302
- Solving multiple objective linear programs in objective space
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
- A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
- A characterisation of the feasible set of objective function vectors in linear multiple objective problems
Cites work
- Algorithms for the vector maximization problem
- An approach to nonlinear programming
- Finding all efficient extreme points for multiple objective linear programs
- Generating all maximal efficient faces for multiple objective linear programs
- scientific article; zbMATH DE number 3634009 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- Linear multiobjective programming
- Multiple criteria decision making. Proceedings of a conference, Jouy-en- Josas, France, May 21-23, 1975
- Solving multiple objective linear programs in objective space
Cited in
(40)- Finding non-dominated solutions in bi-objective integer network flow problems
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
- Linear programming with spheres and hemispheres of objective vectors
- A representation of the set of feasible objectives in multiple objective linear programs
- 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
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
- An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors
- Constructing the set of efficient objective values in linear multiple objective transportation problems
- 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
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
- 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
- The vector linear program solver \textit{Bensolve} -- notes on theoretical background
- 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
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Solving multiple-objective problems in the objective space
- The maximal descriptor index set for a face of a convex polyhedral set and some applications
- Set Optimization—A Rather Short Introduction
- Multiple objective linear programming (MOLP) problems with the same objective space
- Graphical exploration of the weight space in three-objective mixed integer linear programs
- scientific article; zbMATH DE number 3889302 (Why is no real title available?)
- Optimization over the efficient set using an active constraint approach
- Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
- scientific article; zbMATH DE number 4102829 (Why is no real title available?)
- Linear multicriteria sensitivity and shadow costs
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
- Primal and dual algorithms for optimization over the efficient set
- The Parameter Space Investigation Method of Multiple Objective Nonlinear Programming: A Computational Investigation
- scientific article; zbMATH DE number 7312765 (Why is no real title available?)
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- A parametric simplex algorithm for linear vector optimization problems
- Constructing efficient solutions structure of multiobjective linear programming
- Existence of solutions for polyhedral convex set optimization problems
- Solving multiple objective linear programs in objective space
- A characterisation of the feasible set of objective function vectors in linear multiple objective problems
- Objective space for multiple objectives linear fractional programming with equal denominators
- Constructing the set of efficient objective values in multiple objective linear programs
This page was built for publication: Analysis of the objective space in multiple objective linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095043)
