Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems

DOI10.1007/s10479-008-0418-yzbMath1163.90801OpenAlexW1982244879MaRDI QIDQ1026575

Georgy K. Kamenev, Roman V. Efremov

Publication date: 25 June 2009

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

Full work available at URL: https://doi.org/10.1007/s10479-008-0418-y

zbMATH Keywords

polyhedral approximationmulticriteria optimizationfeasible goals methodestimation refinement method

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29)

Related Items (5)

Multicriteria optimization of convex dynamical systems ⋮ Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality ⋮ Covers and approximations in multiobjective optimization ⋮ Constructing a Pareto front approximation for decision making ⋮ PAINT: Pareto front interpolation for nonlinear multiobjective optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A framework for participatory decision support using Pareto frontier visualization, goal identification and arbitration
• A class of adaptive algorithms for approximating convex bodies by polyhedra
• Approximation of the Pareto-hull of a convex set by polyhedral sets
• 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
• Methods and algorithms for analyzing linear systems, by constructing generalized sets of attainability
• Asymptotic estimates for best and stepwise approximation of convex bodies I
• Cognitive validity in design of decision‐aiding techniques

This page was built for publication: Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems