Approximating the Pareto optimal set using a reduced set of objective functions
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6263560
- Set oriented methods for the numerical treatment of multiobjective optimization problems
- Dimensionality reduction in multiobjective optimization: the minimum objective subset problem
- A method for selecting Pareto optimal solutions in multiobjective optimization
- An efficient sampling approach to multiobjective optimization
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
- Consequences of dropping nonessential objectives for the application of MCDM methods
- Dimensionality reduction in multiobjective optimization: the minimum objective subset problem
- Evolutionary Multi-Criterion Optimization
- Evolutionary multi-criterion optimization. 4th international conference, EMO 2007, Matsushima, Japan, March 5--8, 2007. Proceedings
- Multiple criteria decision making: The case for interdependence
- Nonlinear Programming
- Norm methods and partial weighting in multicriterion optimization of structures
- On Efficient Solutions to Multiple Objective Mathematical Programs
- On Finding the Maxima of a Set of Vectors
- On redundancy in multi criteria decision making
- On the number of criteria needed to decide Pareto optimality
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Redundant objective functions in linear vector maximum problems and their determination
- Using metaheuristics in multiobjective resource constrained project scheduling
- \(\epsilon\)-solutions in vector minimization problems
Cited in
(17)- Finding preferred subsets of Pareto optimal solutions
- Aggregate objective functions and Pareto frontiers: required relationships and practical implications
- Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives
- Criteria and dimension reduction of linear multiple criteria optimization problems
- Preprocessing and cut generation techniques for multi-objective binary programming
- A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
- Boosting efficiency for computing the Pareto frontier on tree structured networks
- Higher and lower-level knowledge discovery from Pareto-optimal sets
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion
- Dimensionality reduction in multiobjective optimization: the minimum objective subset problem
- Minimizing the area of a Pareto confidence region
- Approximation of a set of Pareto-optimal solutions
- On Degree of Pareto Set Reduction Using Information Quanta
- Dynamic algorithm selection for Pareto optimal set approximation
- Pareto set reduction based on an arbitrary finite collection of numerical information on the preference relation
- Bargaining on monotonic social choice environments
This page was built for publication: Approximating the Pareto optimal set using a reduced set of objective functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613484)
