Criteria and dimension reduction of linear multiple criteria optimization problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3769296 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 592648 (Why is no real title available?)
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
- Advances in multicriteria analysis
- Algorithms for the vector maximization problem
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Approximating the Pareto optimal set using a reduced set of objective functions
- Changes of the set of efficient solutions by extending the number of objectives and its evaluation
- Computational approach to essential and nonessential objective functions in linear multicriteria optimization
- Conical algorithm in global optimization for optimizing over efficient sets
- Consequences of dropping nonessential objectives for the application of MCDM methods
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Decomposition branch and bound algorithm for optimization problems over efficient sets
- Dimensionality reduction in multiobjective optimization: the minimum objective subset problem
- Introduction to global optimization.
- Maximizing a concave function over the efficient or weakly-efficient set
- Multicriteria Optimization
- Multicriteria methodology for decision aiding. Transl. from the French by Mark R. McCord
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Nonessential objective functions in linear multiobjective optimization problems
- Nonessential objectives within network approaches for MCDM
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- On optimization over the efficient set in linear multicriteria programming
- On redundancy in multi criteria decision making
- Optimization over the efficient set
- Optimization over the efficient set
- Optimization over the efficient set: overview
- Outcome space partition of the weight set in multiobjective linear programming
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Redundant objective functions in linear vector maximum problems and their determination
- Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets
- Utility function programs and optimization over the efficient set in multiple-objective decision making
- Weakly and properly nonessential objectives in multiobjective optimization problems
Cited in
(8)- Preprocessing and cut generation techniques for multi-objective binary programming
- The theory of linear parametrization of criteria in multicriteria optimization
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion
- On highly robust efficient solutions to uncertain multiobjective linear programs
- Decomposition and coordination for many-objective optimization
- Dimension reduction of one multivariable decision making problem
- scientific article; zbMATH DE number 3952486 (Why is no real title available?)
- Introduction to many-criteria optimization and decision analysis
This page was built for publication: Criteria and dimension reduction of linear multiple criteria optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427372)
