Maximal lattice-free convex sets in linear subspaces
Optimization and Control
2017-01-24 v1
Abstract
We consider a model that arises in integer programming, and show that all irredundant inequalities are obtained from maximal lattice-free convex sets in an affine subspace. We also show that these sets are polyhedra. The latter result extends a theorem of Lov\'asz characterizing maximal lattice-free convex sets in .
Cite
@article{arxiv.1701.06543,
title = {Maximal lattice-free convex sets in linear subspaces},
author = {Amitabh Basu and Michele Conforti and Gerard Cornuejols and Giacomo Zambelli},
journal= {arXiv preprint arXiv:1701.06543},
year = {2017}
}