Approximating nondominated sets in continuous multiobjective optimization problems

DOI10.1002/nav.20090zbMath1072.90033OpenAlexW2067806153WikidataQ62038508 ScholiaQ62038508MaRDI QIDQ5318290

David Ríos Insua, Concha Bielza, Jacinto Martín

Publication date: 22 September 2005

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20090

zbMATH Keywords

stochastic optimizationefficient solutionsnonlinear regressionevolutionary algorithmsmultiple objectives

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Stochastic programming (90C15) Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making ⋮ Robust multi‐response surface optimization: a posterior preference approach ⋮ Covers and approximations in multiobjective optimization ⋮ Constructing a Pareto front approximation for decision making ⋮ PAINT: Pareto front interpolation for nonlinear multiobjective optimization ⋮ The Non Dominated Set in Bayesian Decision Problems with Convex Loss Functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sensitivity analysis in multiobjective decision making
• Robust Bayesian analysis

This page was built for publication: Approximating nondominated sets in continuous multiobjective optimization problems