Accession Number:

AD1021086

Title:

Minimal Valid Inequalities for Integer Constraints

Descriptive Note:

OSTP Journal Article

Corporate Author:

Carnegie Mellon University Pittsburgh United States

Personal Author(s):

Report Date:

2008-08-01

Pagination or Media Count:

14.0

Abstract:

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.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE