Efficient Constraint/Generator Removal from Double Description of Polyhedra

Abstract

We present an algorithm for the removal of constraints (resp., generators) from a convex polyhedron represented in the Double Description framework. Instead of recomputing the dual representation from scratch, the new algorithm tries to better exploit the information available in the Double Description pair, so as to capitalize on the computational work… (More)
DOI: 10.1016/j.entcs.2014.08.002

4 Figures and Tables

Topics

  • Presentations referencing similar topics