Constructing a Pareto front approximation for decision making

DOI10.1007/s00186-010-0343-0zbMath1216.49002OpenAlexW2149157137WikidataQ109285143 ScholiaQ109285143MaRDI QIDQ532529

Margaret M. Wiecek, Markus E. Hartikainen, Kaisa M. Miettinen

Publication date: 5 May 2011

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: http://urn.fi/URN:NBN:fi:jyu-201607283689

zbMATH Keywords

interpolationmultiobjective optimizationPareto optimalitymultiple criteria decision makingDelaunay triangulationinteractive decision making

Mathematics Subject Classification ID

Convex programming (90C25) Existence theories for free problems in two or more independent variables (49J10) Optimality conditions for free problems in two or more independent variables (49K10)

Related Items (13)

A new algorithm using front prediction and NSGA-II for solving two and three-objective optimization problems ⋮ Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach ⋮ An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making ⋮ Global search perspectives for multiobjective optimization ⋮ Sustainable supply chain network design: a study of the Colombian dairy sector ⋮ On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach ⋮ Interactive \textsc{Nonconvex Pareto Navigator} for multiobjective optimization ⋮ Covers and approximations in multiobjective optimization ⋮ PAINT: Pareto front interpolation for nonlinear multiobjective optimization ⋮ A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem ⋮ Non-convex Pareto set navigation ⋮ Multiple-gradient Descent Algorithm for Pareto-Front Identification ⋮ \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization

Uses Software

• NIMBUS
• Voronoi
• Pareto navigator

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global formulation for interactive multiobjective optimization
• Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems
• Theory of multiobjective optimization
• Complementary error bounds for foolproof finite element mesh generation
• On the completeness and constructiveness of parametric characterizations to vector optimization problems
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Nonlinear multiobjective optimization
• Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
• Norm-based approximation in multicriteria programming.
• Interactive multiobjective optimization system WWW-NIMBUS on the Internet
• Pareto navigator for interactive nonlinear multiobjective optimization
• Response surface approximation of Pareto optimal front in multi-objective optimization
• Synchronous approach in interactive multiobjective optimization
• Approximation methods in multiobjective programming
• An interactive weighted Tchebycheff procedure for multiple objective programming
• Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus^§
• Approximating nondominated sets in continuous multiobjective optimization problems
• Evolutionary Algorithms for Solving Multi-Objective Problems
• The maximum numbers of faces of a convex polytope
• Norm-based approximation in bicriteria programming

This page was built for publication: Constructing a Pareto front approximation for decision making