Macaulay2 package FourierMotzkin -- for convex hull and vertex enumeration. A convex cone is polyhedral if it is a finite intersection of halfspaces. A convex cone is finitely generated if it is the set of all nonnegative linear combinations of a finite set of vectors. The fundamental theorem for cones states that a convex cone is polyhedral if and only if it is finitely generated. FourierMotzkin is a Macaulay2 implementation of the Double Description Method (of Fourier, Dines and Motzkin) for converting between these two basic representations for convex cones. For polytopes, this allows one to convert between the convex hull of a finite point set and the bounded intersection of halfspaces.
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Barker, Amy; Swinarski, David; Vogelstein, Lauren; Wu, John: A new proof of a formula for the type (A_2) fusion rules (2015)
- Ziegler, Günter M.: Lectures on polytopes (1995)