A simple method for approximating a general Pareto surface

DOI10.1002/mcda.453zbMath1214.90109OpenAlexW2095556578MaRDI QIDQ3005831

Pertti Pulkkinen, Tapani Lehtonen

Publication date: 9 June 2011

Published in: Journal of Multi-Criteria Decision Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/mcda.453

zbMATH Keywords

upper boundmultiobjective optimizationdominationapproximation of Pareto surface

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Interactive multiple objective optimization: Survey. I: Continuous case
• Bound sets for biobjective combinatorial optimization problems
• Multiobjective optimization. Interactive and evolutionary approaches
• Nonlinear multiobjective optimization
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• Metaheuristics for multiobjective optimisation
• Unbiased approximation in multicriteria optimization
• Interactive decision maps. Approximation and visualization of Pareto frontier
• Approximation methods in multiobjective programming
• Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
• Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making

This page was built for publication: A simple method for approximating a general Pareto surface