On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts

被引:3
作者
Balas, Egon [1 ]
Kis, Tamas [2 ]
机构
[1] Carnegie Mellon Univ, Tepper Sch Business, Pittsburgh, PA 15213 USA
[2] Inst Comp Sci & Control, H-1518 Budapest, Hungary
基金
美国国家科学基金会;
关键词
Integer programming; Intersection cuts; Lift-and-project cuts; Generalized intersection cuts; Corner polyhedra; RELAXATIONS;
D O I
10.1007/s10107-015-0975-1
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We examine the connections between the classes of cuts in the title. We show that lift-and-project (L&P) cuts from a given disjunction are equivalent to generalized intersection cuts from the family of polyhedra obtained by taking positive combinations of the complements of the inequalities of each term of the disjunction. While L&P cuts from split disjunctions are known to be equivalent to standard intersection cuts (SICs) from the strip obtained by complementing the terms of the split, we show that L&P cuts from more general disjunctions may not be equivalent to any SIC. In particular, we give easily verifiable necessary and sufficient conditions for a L&P cut from a given disjunction D to be equivalent to a SIC from the polyhedral counterpart of D. Irregular L&P cuts, i.e. those that violate these conditions, have interesting properties. For instance, unlike the regular ones, they may cut off part of the corner polyhedron associated with the LP solution from which they are derived. Furthermore, they are not exceptional: their frequency exceeds that of regular cuts. A numerical example illustrates some of the above properties.
引用
收藏
页码:85 / 114
页数:30
相关论文
共 21 条