A polyhedron can be described by a list of inequalities or by a list of its vertices and extreme rays. The lrs program converts a H-representation of a polyhedron to its V-representation, and vice versa. These problems are known respectively at the vertex enumeration and convex hull problems.
