A dynamic algorithm for constructing the dual representation of a polyhedral cone

DOI10.1007/978-3-030-22629-9_5zbMath1443.90248OpenAlexW2950875480MaRDI QIDQ2181743

S. O. Semenov, Nikolai Yu. Zolotykh

Publication date: 19 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-22629-9_5

zbMATH Keywords

conepolyhedronconvex hullsystem of linear inequalitiesdouble description method

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (1)

How to find the convex hull of all integer points in a polyhedron?

This page was built for publication: A dynamic algorithm for constructing the dual representation of a polyhedral cone