Consider a generic linear programming problem and any of its constrints Ai x not greater then bi. From a geometric point of view, the set of the solutions of this inequality is a closed half space.
As a consequence, the feasible set of an LP problem is the intersection of a finite number of closed half-spaces. A set with this structure is called a polyhedron.