Construction of the convex hull of a finite set of points when the computations are approximate

DOI10.1016/0041-5553(88)90010-9zbMath0695.90060OpenAlexW2078166772MaRDI QIDQ3471848

O. L. Chernykh

Publication date: 1988

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(88)90010-9

zbMATH Keywords

system of linear inequalitiesestimate of the errorinaccurate computations

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (6)

Convergence of Hausdorff approximation methods for the Edgeworth-Pareto hull of a compact set ⋮ Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\) ⋮ Application of the method of convexification to find a multivalued integral ⋮ Multiple objective analysis of long-term development strategies for a national economy ⋮ Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems ⋮ Optimality of the Methods for Approximating the Feasible Criterion Set in the Convex Case

This page was built for publication: Construction of the convex hull of a finite set of points when the computations are approximate