Resource title

Minimal inequalities for an infinite relaxation of integer programs

Resource image

image for OpenScout resource :: Minimal inequalities for an infinite relaxation of integer programs

Resource description

We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn. This result extends a theorem of Lovasz characterizing maximal lattice-free convex sets. We then consider a model that arises in integer programming, and show that all irredundant inequalities are obtained from maximal S-free convex sets.

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

Resource resource URL

http://eprints.lse.ac.uk/31581/

Resource license