Approximating nondominated sets in continuous multiobjective optimization problems

DOI10.1002/NAV.20090MaRDI QIDQ5318290zbMATH OpenOpenAlexWikidataFDO

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

Publication date 22 September 2005

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

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

zbMATH Keywords

efficient solutionsevolutionary algorithmsmultiple objectivesnonlinear regressionstochastic optimization

Mathematics Subject Classification ID

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

Recommendations

• Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
• An approximation algorithm for multi-objective optimization problems using a box-coverage
• Decision making on Pareto front approximations with inherent nondominance
• An approximation algorithm for convex multi-objective programming problems
• Recent developments in screening methods for nondominated solutions in multiobjective optimization

Cites work

• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 48904 (Why is no real title available?)
• scientific article; zbMATH DE number 3992765 (Why is no real title available?)
• Robust Bayesian analysis
• Sensitivity analysis in multiobjective decision making

Cited in

(14)

• Recent developments in screening methods for nondominated solutions in multiobjective optimization
• An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making
• On the number of non-dominated points of a multicriteria optimization problem
• CHESS -- changing horizon efficient set search: a simple principle for multiobjective optimization
• Decision making on Pareto front approximations with inherent nondominance
• Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
• scientific article; zbMATH DE number 1975102 (Why is no real title available?)
• Covers and approximations in multiobjective optimization
• Constructing a Pareto front approximation for decision making
• The Non Dominated Set in Bayesian Decision Problems with Convex Loss Functions
• Robust multi‐response surface optimization: a posterior preference approach
• A framework for expected capability sets
• PAINT: Pareto front interpolation for nonlinear multiobjective optimization
• Approximating the nondominated set of an MOLP by approximately solving its dual problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5318290)