X-Git-Url: https://scm.cri.ensmp.fr/git/linpy.git/blobdiff_plain/a16251fd5fb481e97f05fd488ad718ba2147396b..33d593f633df2de00010d668e3ef17f1b6152ac9:/doc/reference.rst

diff --git a/doc/reference.rst b/doc/reference.rst
index 4a2c419..56986c5 100644
--- a/doc/reference.rst
+++ b/doc/reference.rst
@@ -164,6 +164,8 @@ For example, if ``x`` is a :class:`Symbol`, then ``x + 1`` is an instance of :cl
     .. method:: __eq__(expr)
 
         Test whether two linear expressions are equal.
+        Unlike methods :meth:`LinExpr.__lt__`, :meth:`LinExpr.__le__`, :meth:`LinExpr.__ge__`, :meth:`LinExpr.__gt__`, the result is a boolean value, not a polyhedron.
+        To express that two linear expressions are equal or not equal, use functions :func:`Eq` and :func:`Ne` instead.
 
     As explained below, it is possible to create polyhedra from linear expressions using comparison methods.
 
@@ -241,6 +243,7 @@ Polyhedra
 
 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)