Disjunctive programming and relaxations of polyhedra

• 成果类型: Article
• 署名作者: Conforti, Michele; Del Pia, Alberto
• 署名单位: University of Padua; Swiss Federal Institutes of Technology Domain; ETH Zurich
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-013-0634-3
• 发表日期: 2014
• 页码: 307-314
• 关键词: intersection cuts; rank

摘要

Given a polyhedron with facets, whose interior contains no integral points, and a polyhedron , recent work in integer programming has focused on characterizing the convex hull of minus the interior of . We show that to obtain such a characterization it suffices to consider all relaxations of defined by at most among the inequalities defining . This extends a result by Andersen, Cornu,jols, and Li.