A *convex polyhedron* (or simply "polyhedron") is the space defined by a system of linear equalities and inequalities.
This space can be unbounded.
+A *Z-polyhedron* (simply called "polyhedron" in LinPy) is the set of integer points in a convex polyhedron.
.. class:: Polyhedron(equalities, inequalities)
Polyhedron(string)
.. _tutorial_polyhedra:
-Polyhedra
----------
+Z-Polyhedra
+-----------
The following example shows how we can manipulate polyhedra using LinPy.
Let us define two square polyhedra, corresponding to the sets ``square1 = {(x, y) | 0 <= x <= 2, 0 <= y <= 2}`` and ``square2 = {(x, y) | 2 <= x <= 4, 2 <= y <= 4}``.
class Polyhedron(Domain):
"""
A convex polyhedron (or simply "polyhedron") is the space defined by a
- system of linear equalities and inequalities. This space can be
- unbounded.
+ system of linear equalities and inequalities. This space can be unbounded. A
+ Z-polyhedron (simply called "polyhedron" in LinPy) is the set of integer
+ points in a convex polyhedron.
"""
__slots__ = (