Date of Original Version

8-2008

Type

Article

Abstract or Description

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.

DOI

10.1287/moor.1080.0370

Share

COinS
 

Published In

Mathematics of Operations Research, 34, 3, 538-546.