Cookies?
Library Header Image
LSE Research Online LSE Library Services

Maximal lattice-free convex sets in linear subspaces

Basu, Amitabh , Conforti, Michele, Cornuéjols, Gérard and Zambelli, Giacomo (2010) Maximal lattice-free convex sets in linear subspaces. Mathematics of Operations Research, 35 (3). pp. 704-720. ISSN 0364-765X

Full text not available from this repository.

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

Item Type: Article
Official URL: http://mor.journal.informs.org/
Additional Information: © 2010 Informs
Library of Congress subject classification: Q Science > QA Mathematics
Sets: Departments > Management
Rights: http://www.lse.ac.uk/library/usingTheLibrary/academicSupport/OA/depositYourResearch.aspx
Date Deposited: 21 Jan 2011 12:36
URL: http://eprints.lse.ac.uk/31544/

Actions (login required)

Record administration - authorised staff only Record administration - authorised staff only