Date of Original Version
Mathematics of Operations Research, Vol. 34, No. 3, August 2009, pp. 538-546
Abstract or Table of Contents
In this paper we consider a semi-infinite relaxation of mixed integer linear programs. We show that minimal valid inequalities for this relaxation correspond to maximal lattice- free convex sets, and that they arise from nonnegative, piecewise linear, positively homogeneous, convex functions.