On the Polyhedrality of the Convex Hull of the Feasible Set of an Integer Program.

摘要

Polyhedrality is established for convex hulls of sets defined by systems of equations in non-negative integer variables. This property is useful for certain existence, duality, and sensitivity results in integer programming. The structural theorems obtained also shed some light on the relationship between the convex hull and the relaxation obtained by deleting integrality constraints. (Author)