Verified methods for computing Pareto sets: general algorithmic analysis

DOI10.2478/V10006-009-0031-5MaRDI QIDQ6487155zbMATH OpenOpenAlexFDO

Authors Boglárka G.-Tóth, Vladik Kreinovich

Publication date 19 November 2014

Published in International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2478/v10006-009-0031-5

zbMATH Keywords

multi-objective optimizationPareto setverified computing

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Recommendations

• Numerical certification of Pareto optimality for biobjective nonlinear problems
• Set oriented methods for the numerical treatment of multiobjective optimization problems
• Fast computation of equispaced Pareto manifolds and Pareto fronts for multiobjective optimization problems
• Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization
• From computing sets of optima, Pareto sets, and sets of Nash equilibria to general decision-related set computations

Cites work

• scientific article; zbMATH DE number 3871350 (Why is no real title available?)
• scientific article; zbMATH DE number 3900744 (Why is no real title available?)
• scientific article; zbMATH DE number 4070894 (Why is no real title available?)
• Approximation methods in multiobjective programming
• Computational complexity and feasibility of data processing and interval computations
• Introduction to precise numerical methods. With CD-ROM.
• Location theory. A unified approach
• Multiple criteria decision analysis. State of the art surveys
• Non-computable strategies and discounted repeated games
• Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
• Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
• Reconciling franchisor and franchisee: a planar biobjective competitive location and design model
• Some relations between classical and constructive mathematics

Cited in

(6)

• A class of problems that can be solved using interval algorithms
• A survey of interval algorithms for solving multicriteria analysis problems
• From computing sets of optima, Pareto sets, and sets of Nash equilibria to general decision-related set computations
• Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach
• Numerical certification of Pareto optimality for biobjective nonlinear problems
• Convergence method, properties and computational complexity for Lyapunov games

Describes a project that uses

Uses Software

• PNM

This page was built for publication: Verified methods for computing Pareto sets: general algorithmic analysis

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