Approximating the Pareto optimal set using a reduced set of objective functions
From MaRDI portal
Publication:613484
DOI10.1016/J.EJOR.2010.07.004zbMATH Open1205.90263OpenAlexW2016203627MaRDI QIDQ613484FDOQ613484
Peter Lindroth, Ann-Brith Strömberg, Michael Patriksson
Publication date: 20 December 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.07.004
multiple objective programmingPareto optimalitymany-objective optimizationengineering optimizationobjective space reduction
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(\epsilon\)-solutions in vector minimization problems
- On Efficient Solutions to Multiple Objective Mathematical Programs
- Nonlinear Programming
- On Finding the Maxima of a Set of Vectors
- Evolutionary multi-criterion optimization. 4th international conference, EMO 2007, Matsushima, Japan, March 5--8, 2007. Proceedings
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Evolutionary Multi-Criterion Optimization
- Using metaheuristics in multiobjective resource constrained project scheduling
- Redundant objective functions in linear vector maximum problems and their determination
- Multiple criteria decision making: The case for interdependence
- Norm methods and partial weighting in multicriterion optimization of structures
- On redundancy in multi criteria decision making
- Consequences of dropping nonessential objectives for the application of MCDM methods
- Dimensionality Reduction in Multiobjective Optimization: The Minimum Objective Subset Problem
- On the number of criteria needed to decide Pareto optimality
Cited In (14)
- 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
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
- Higher and lower-level knowledge discovery from Pareto-optimal sets
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion
- Approximation of a set of Pareto-optimal solutions
- Minimizing the area of a Pareto confidence region
- On Degree of Pareto Set Reduction Using Information Quanta
- Dynamic algorithm selection for Pareto optimal set approximation
- Bargaining on monotonic social choice environments
- Pareto set reduction based on an arbitrary finite collection of numerical information on the preference relation
- Aggregate objective functions and Pareto frontiers: required relationships and practical implications
- Finding preferred subsets of Pareto optimal solutions
Uses Software
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)
