Optimization Online


On Maximal S-free Convex Sets

Diego A. Moran R. (dmoran***at***isye.gatech.edu)
Santanu S. Dey (santanu.dey***at***isye.gatech.edu)

Abstract: Let S be a subset of integer points that satisfy the property that $conv(S) \cap Z^n = S$. Then a convex set K is called an S-free convex set if $int(K) \cap S = \emptyset$. A maximal S-free convex set is an S-free convex set that is not properly contained in any S-free convex set. We show that maximal S-free convex sets are polyhedra. This result generalizes a result of Basu et al. (2010) for the case where S is the set of integer points in a rational polyhedron and a result of Lovasz (1989) and Basu et al. (2009) for the case where $S$ is the set of integer points in some affine subspace of $R^n$.

Keywords: Integer nonlinear programming, Cutting planes, Maximal lattice-free convex sets

Category 1: Integer Programming ((Mixed) Integer Nonlinear Programming )

Category 2: Integer Programming (Cutting Plane Approaches )


Download: [PDF]

Entry Submitted: 05/29/2010
Entry Accepted: 05/29/2010
Entry Last Modified: 05/29/2010

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society