Minimal Valid Inequalities for Integer Constraints
OSTP Journal Article
Carnegie Mellon University Pittsburgh United States
Pagination or Media Count:
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.
- Operations Research