Resource title

Maximal lattice-free convex sets in linear subspaces

Resource image

image for OpenScout resource :: Maximal lattice-free convex sets in linear subspaces

Resource description

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ász characterizing maximal lattice-free convex sets in Rn.

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

Resource resource URL

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

Resource license