A Constructive Characterization of the Split Closure of a Mixed Integer Linear Program

ACO Student Seminar
Wednesday, November 26, 2008 - 13:30
2 hours
ISyE Executive Classroom
ISyE, Georgia Tech
Two independent proofs of the polyhedrality of the split closure of Mixed Integer Linear Program have been previously presented. Unfortunately neither of these proofs is constructive. In this paper, we present a constructive version of this proof. We also show that split cuts dominate a family of inequalities introduced by Koppe and Weismantel.