On sublinear inequalities for mixed integer conic programs

• 成果类型: Article
• 署名作者: Kilinc-Karzan, Fatma; Steffy, Daniel E.
• 署名单位: Carnegie Mellon University; Oakland University
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-015-0968-0
• 发表日期: 2016
• 页码: 585-605
• 关键词: minimal-inequalities; cuts

摘要

This paper studies -sublinear inequalities, a class of inequalities with strong relations to -minimal inequalities for disjunctive conic sets. We establish a stronger result on the sufficiency of -sublinear inequalities. That is, we show that when is the nonnegative orthant or the second-order cone, -sublinear inequalities together with the original conic constraint are always sufficient for the closed convex hull description of the associated disjunctive conic set. When is the nonnegative orthant, -sublinear inequalities are tightly connected to functions that generate cuts-so called cut-generating functions. In particular, we introduce the concept of relaxed cut-generating functions and show that each -sublinear inequality is generated by one of these. We then relate the relaxed cut-generating functions to the usual ones studied in the literature. Recently, under a structural assumption, Cornujols, Wolsey and YA +/- ldA +/- z established the sufficiency of cut-generating functions in terms of generating all nontrivial valid inequalities of disjunctive sets where the underlying cone is nonnegative orthant. We provide an alternate and straightforward proof of this result under the same assumption as a consequence of the sufficiency of -sublinear inequalities and their connection with relaxed cut-generating functions.