An algorithm for approximating polyhedra.
From MaRDI portal
Publication:1425870
zbMath1161.52301MaRDI QIDQ1425870
Publication date: 18 March 2004
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
(n)-dimensional polytopes (52B11) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Approximation by convex sets (52A27) Numerical approximation and computational geometry (primarily algorithms) (65D99)
Related Items (4)
On sufficient optimality conditions for a guaranteed control in the speed problem for a linear time-varying discrete-time system with bounded control ⋮ Multipolar robust optimization ⋮ Approximation of convex sets by polytopes ⋮ Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)
This page was built for publication: An algorithm for approximating polyhedra.
