A class of multi-level balanced Foundation-Penalty cuts for mixed-integer programs

Glover and Sherali (2003) introduced a wide class of Foundation-Penalty (FP) cuts for GUB and ordinary mixed-integer programs. The FP cuts are easy to generate by exploiting routine branch-and-bound penalty calculations, and encompass other classical cuts such as disjunctive cuts, lift-and-project cuts, convexity cuts, Gomory cuts, and mixed-integer rounding cuts. Here we focus on two special classes of FP cuts, called balanced FP cuts and multi-level balanced FP cuts, and exhibit their relationship to special forms of disjunctive cuts. A numerical example illustrates the rich variety of cuts that can be generated.

[1]  Ralph E. Gomory,et al.  Solving linear programming problems in integers , 1960 .

[2]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[3]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[4]  Ronald L. Rardin,et al.  Surrogate Dual Multiplier Search Procedures in Integer Programming , 1984, Oper. Res..

[5]  Fred W. Glover,et al.  Polyhedral annexation in mixed integer and combinatorial programming , 1975, Math. Program..

[6]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[7]  Laurence A. Wolsey,et al.  Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..

[8]  Martin W. P. Savelsbergh,et al.  A Computational Study of Search Strategies for Mixed Integer Programming , 1999, INFORMS J. Comput..

[9]  Hanif D. Sherali,et al.  Disjunctive Programming , 2009, Encyclopedia of Optimization.

[10]  Fred W. Glover.  Convexity cuts for multiple choice problems , 1973, Discret. Math..

[11]  Fred W. Glover,et al.  Foundation-penalty cuts for mixed-integer programs , 2003, Oper. Res. Lett..

[12]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[13]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..

[14]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

[15]  Hanif D. Sherali,et al.  Optimization with disjunctive constraints , 1980 .

[16]  Egon Balas,et al.  programming: Properties of the convex hull of feasible points * , 1998 .