Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems
type: Item
instance of: scholarly article
title: Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems
zbMATH Open document ID: 1163.90801
author: R. V. Efremov
author: G. K. Kamenev
published in: Annals of Operations Research
publication date: 2009-06-25T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 5570708
zbMATH Keywords: multicriteria optimization
zbMATH Keywords: polyhedral approximation
zbMATH Keywords: estimation refinement method
zbMATH Keywords: feasible goals method
MaRDI profile type: Publication
full work available at URL: s10479-008-0418-y
OpenAlex ID: W1982244879
cites work: Methods and algorithms for analyzing linear systems, by constructing generalized sets of attainability
cites work: Construction of the convex hull of a finite set of points when the computations are approximate
cites work: Approximation of the Pareto-hull of a convex set by polyhedral sets
cites work: Q4831898
cites work: A framework for participatory decision support using Pareto frontier visualization, goal identification and arbitration
cites work: Asymptotic estimates for best and stepwise approximation of convex bodies I
cites work: A class of adaptive algorithms for approximating convex bodies by polyhedra
cites work: Cognitive validity in design of decision‐aiding techniques
cites work: Interactive decision maps. Approximation and visualization of Pareto frontier
cites work: Q5621733
cites work: Q3694703
cites work: Q3917913
DOI: 10.1007/S10479-008-0418-Y
description: scientific article; zbMATH DE number 5570708