Criteria and dimension reduction of linear multiple criteria optimization problems
From MaRDI portal
Publication:427372
DOI10.1007/s10898-011-9764-4zbMath1245.90118OpenAlexW2144586426MaRDI QIDQ427372
Publication date: 13 June 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9764-4
dimension reductionoptimization over the efficient setmulticriteria optimizationcriteria reductionutility function programs
Related Items
Decomposition and Coordination for Many-Objective Optimization, Approximating combinatorial optimization problems with the ordered weighted averaging criterion, On highly robust efficient solutions to uncertain multiobjective linear programs, Preprocessing and cut generation techniques for multi-objective binary programming
Cites Work
- Optimization over the efficient set: overview
- Approximating the Pareto optimal set using a reduced set of objective functions
- Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Weakly and properly nonessential objectives in multiobjective optimization problems
- Decomposition branch and bound algorithm for optimization problems over efficient sets
- Computational approach to essential and nonessential objective functions in linear multicriteria optimization
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Redundant objective functions in linear vector maximum problems and their determination
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- On redundancy in multi criteria decision making
- Utility function programs and optimization over the efficient set in multiple-objective decision making
- Outcome space partition of the weight set in multiobjective linear programming
- Consequences of dropping nonessential objectives for the application of MCDM methods
- Maximizing a concave function over the efficient or weakly-efficient set
- 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
- Advances in multicriteria analysis
- On optimization over the efficient set in linear multicriteria programming
- Multicriteria methodology for decision aiding. Transl. from the French by Mark R. McCord
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Nonessential objectives within network approaches for MCDM
- Algorithms for the vector maximization problem
- Multicriteria Optimization
- Dimensionality Reduction in Multiobjective Optimization: The Minimum Objective Subset Problem
- Optimization over the efficient set
- Optimization over the efficient set
- Introduction to global optimization.
- Conical algorithm in global optimization for optimizing over efficient sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
