Optimization Online


The Chvatal-Gomory Closure of a Strictly Convex Body

Daniel Dadush(dndadush***at***gmail.com)
Santanu S. Dey(santanu.dey***at***isye.gatech.edu)
Juan Pablo Vielma(jvielma***at***pitt.edu)

Abstract: In this paper, we prove that the Chvatal-Gomory closure of a set obtained as an intersection of a strictly convex body and a rational polyhedron is a polyhedron. Thus, we generalize a result of Schrijver which shows that the Chvatal-Gomory closure of a rational polyhedron is a polyhedron.

Keywords: nonlinear integer programming; cutting planes; Chvatal-Gomory closure

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

Category 2: Integer Programming (Cutting Plane Approaches )


Download: [PDF]

Entry Submitted: 05/03/2010
Entry Accepted: 05/03/2010
Entry Last Modified: 05/03/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