Constructing a Pareto front approximation for decision making
From MaRDI portal
Publication:532529
DOI10.1007/S00186-010-0343-0zbMATH Open1216.49002OpenAlexW2149157137WikidataQ109285143 ScholiaQ109285143MaRDI QIDQ532529FDOQ532529
Authors: Margaret M. Wiecek, Markus E. Hartikainen, Kaisa 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
Recommendations
- Decision making on Pareto front approximations with inherent nondominance
- Approximating the Pareto front of multi-criteria optimization problems
- Algorithms and Computation
- Decision-making based on approximate and smoothed Pareto curves
- Considering dynamic Pareto frontiers in decision making
- A new approach to approximate the bounded Pareto front
- Interactive decision maps. Approximation and visualization of Pareto frontier
- Two-sided Pareto front approximations
- Methods to find the most preferred element on a set of Pareto-optimal decisions
interpolationmultiobjective optimizationPareto optimalityDelaunay triangulationmultiple criteria decision makinginteractive decision making
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)
Cites Work
- Pareto navigator for interactive nonlinear multiobjective optimization
- Theory of multiobjective optimization
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Nonlinear multiobjective optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global formulation for interactive multiobjective optimization
- Multi-objective optimization using evolutionary algorithms
- Title not available (Why is that?)
- Evolutionary Algorithms for Solving Multi-Objective Problems
- The maximum numbers of faces of a convex polytope
- Title not available (Why is that?)
- Approximation methods in multiobjective programming
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus§
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Norm-based approximation in multicriteria programming.
- Response surface approximation of Pareto optimal front in multi-objective optimization
- Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
- Synchronous approach in interactive multiobjective optimization
- Interactive multiobjective optimization system WWW-NIMBUS on the Internet
- Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems
- Approximating nondominated sets in continuous multiobjective optimization problems
- Complementary error bounds for foolproof finite element mesh generation
- Title not available (Why is that?)
- Norm-based approximation in bicriteria programming
Cited In (30)
- Pareto landscapes analyses via graph-based modeling for interactive decision-making
- Visualization of a statistical approximation of the Pareto front
- Prediction of Pareto dominance using nearest neighbor method based on decision space transformation
- On upper approximations of Pareto fronts
- Construction of Pareto set in a system of conceptual uncertainty problems
- On the estimation of Pareto fronts from the point of view of copula theory
- A computationally efficient algorithm to approximate the Pareto front of multi-objective linear fractional programming problem
- Decision making on Pareto front approximations with inherent nondominance
- Response surface approximation of Pareto optimal front in multi-objective optimization
- Pareto frontier based concept selection under uncertainty, with visualization
- \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization
- 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
- A method of approximating Pareto sets for assessments of implicit Pareto set elements
- Two-sided Pareto front approximations
- Comparison of two Pareto frontier approximations
- Multiple-gradient descent algorithm for Pareto-front identification
- PAINT: Pareto front interpolation for nonlinear multiobjective optimization
- On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
- An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making
- Efficient Pareto frontier exploration using surrogate approximations
- Clustering aided approach for decision making in computationally expensive multiobjective optimization
- Approximating the Pareto front of multi-criteria optimization problems
- A simple method for approximating a general Pareto surface
- Title not available (Why is that?)
- Covers and approximations in multiobjective optimization
- Sustainable supply chain network design: a study of the Colombian dairy sector
- Global search perspectives for multiobjective optimization
- Non-convex Pareto set navigation
- Interactive \textsc{Nonconvex Pareto Navigator} for multiobjective optimization
Uses Software
This page was built for publication: Constructing a Pareto front approximation for decision making
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q532529)
