A polyhedral set is a set of points bounded by linear constraints.  It can be represented as a system of linear equalities and non-strict inequalities (called its H-Representation) or as sum of the convex combination of a set of vertices and the conical combination of a set of rays (called its V-Representation).  This package provides commands for working with polyhedral sets whose relations or vertices and rays have rational coefficients.

The ZPolyhedralSets subpackage provides a collection of commands for computing with Z-polyhedral sets.  A Z-polyhedral set is the intersection of a polyhedral set with an integer lattice.

The ExampleSets subpackage provides a collection of examples that can be used with commands in the PolyhedralSets package.

Each command in the PolyhedralSets package can be accessed by using either the long form or the short form of the command name in the command calling sequence.

The long form, PolyhedralSets:-command, is always available. The short form can be used after loading the package.

The PolyhedralSets package was introduced in Maple 2015.

For more information on Maple 2015 changes, see Updates in Maple 2015.