Foundation-penalty cuts for mixed-integer programs

We propose a new class of foundation-penalty (FP) cuts for MIPs that are easy to generate by exploiting routine penalty calculations. Their underlying concept generalizes the lifting process and provides derivations of major classical cuts. (Gomory cuts arise from low level FP cuts by simply 'plugging in' standard penalties.)

[1]  Martin W. P. Savelsbergh,et al.  Lifted flow cover inequalities for mixed 0-1 integer programs , 1999, Math. Program..

[2]  Hanif D. Sherali,et al.  A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope , 1995, Oper. Res. Lett..

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

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

[5]  F. Grimm.  Personal communication in the UHF band , 1966 .

[6]  Ellis L. Johnson,et al.  Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..

[7]  Hanif D. Sherali,et al.  Partial convexification cuts for 0-1 mixed-integer programs , 2005, Eur. J. Oper. Res..

[8]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

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

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

[11]  Fred Glover,et al.  Inequalities for mixed integer programs with structure , 1976 .

[12]  R. Gomory.  Some polyhedra related to combinatorial problems , 1969 .

[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]  Martin W. P. Savelsbergh,et al.  Sequence Independent Lifting of Cover Inequalities , 1995, IPCO.

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

[16]  Hanif D. Sherali,et al.  Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems , 1998, Oper. Res..

[17]  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..

[18]  Fred W. Glover,et al.  Generating Cuts from Surrogate Constraint Analysis for Zero-One and Multiple Choice Programming , 1997, Comput. Optim. Appl..

[19]  Robert G. Jeroslow,et al.  Cutting-Plane Theory: Disjunctive Methods , 1977 .

[20]  E. Balas,et al.  Facets of the Knapsack Polytope From Minimal Covers , 1978 .

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

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

[23]  Peter L. Hammer,et al.  Facet of regular 0–1 polytopes , 1975, Math. Program..

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

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

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

[27]  Hanif D. Sherali,et al.  Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes , 1995, SIAM J. Discret. Math..

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

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