Optimality of the Methods for Approximating the Feasible Criterion Set in the Convex Case

DOI10.1007/978-3-540-85646-7_3zbMath1176.90530OpenAlexW31032969MaRDI QIDQ3649587

Georgy K. Kamenev, Roman V. Efremov

Publication date: 4 December 2009

Published in: Multiobjective Programming and Goal Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85646-7_3

zbMATH Keywords

goal programminginteractive decision mapsfeasible goals methodestimation refinement

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Cites Work

• Unnamed Item
• Unnamed Item
• A class of adaptive algorithms for approximating convex bodies by polyhedra
• Approximation of the Pareto-hull of a convex set by polyhedral sets
• Analysis of an algorithm for approximating convex bodies
• Interactive decision maps. Approximation and visualization of Pareto frontier
• Construction of the convex hull of a finite set of points when the computations are approximate
• Blaschke’s rolling theorem in 𝑅ⁿ

This page was built for publication: Optimality of the Methods for Approximating the Feasible Criterion Set in the Convex Case