Verified methods for computing Pareto sets: general algorithmic analysis
From MaRDI portal
DOI10.2478/V10006-009-0031-5zbMATH Open1300.90041OpenAlexW2162372718MaRDI QIDQ6487155FDOQ6487155
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
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
- Introduction to precise numerical methods. With CD-ROM.
- Multiple criteria decision analysis. State of the art surveys
- Location theory. A unified approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational complexity and feasibility of data processing and interval computations
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Approximation methods in multiobjective programming
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Non-computable strategies and discounted repeated games
- Reconciling franchisor and franchisee: a planar biobjective competitive location and design model
- Title not available (Why is that?)
- Some relations between classical and constructive mathematics
Uses Software
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)
