Lifting for mixed integer programs with variable upper bounds

We investigate the convex hull of the set defined by a single inequality with continuous and binary variables, which are additionally related by variable upper bound constraints. First we elaborate on general sequence dependent lifting for this set and present a dynamic program for calculating lifting coefficients. Then we study variable fixings of this set to knapsack covers and to the single binary variable polytope. We explicitly give lifting coefficients of continuous variables when lifting the knapsack cover inequality. We provide two new families of facet-defining inequalities for the single binary variable polytope and we prove that combined with the trivial inequalities they give a full description of this polytope.

[1]  Emrah Cimren.  Valid Inequalities for The 0-1 Mixed Knapsack Polytope with Upper Bounds , 2010 .

[2]  Laurence A. Wolsey,et al.  Valid Inequalities and Superadditivity for 0-1 Integer Programs , 1977, Math. Oper. Res..

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

[4]  E. J. Anderson,et al.  Deterministic Lotsizing Models for Production Planning , 1991 .

[5]  Alper Atamtürk.  Cover and Pack Inequalities for (Mixed) Integer Programming , 2005, Ann. Oper. Res..

[6]  Laurence A. Wolsey,et al.  Valid inequalities for mixed 0-1 programs , 1986, Discret. Appl. Math..

[7]  Laurence A. Wolsey,et al.  The 0-1 Knapsack problem with a single continuous variable , 1999, Math. Program..

[8]  Miguel Fragoso Constantino,et al.  Polyhedral description of the integer single node flow set with constant bounds , 2006, Math. Program..

[9]  Martin W. P. Savelsbergh,et al.  Lifted Cover Inequalities for 0-1 Integer Programs: Complexity , 1999, INFORMS J. Comput..

[10]  George L. Nemhauser,et al.  Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms , 2002, IPCO.

[11]  Oktay Günlük,et al.  Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..

[12]  M. Goemans.  Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds , 1989 .

[13]  Thomas L. Magnanti,et al.  The convex hull of two core capacitated network design problems , 1993, Math. Program..

[14]  Laurence A. Wolsey,et al.  Cutting planes in integer and mixed integer programming , 2002, Discret. Appl. Math..

[15]  Martin W. P. Savelsbergh,et al.  Preprocessing and Probing Techniques for Mixed Integer Programming Problems , 1994, INFORMS J. Comput..

[16]  Martin W. P. Savelsbergh,et al.  On the polyhedral structure of a multi–item production planning model with setup times , 2003, Math. Program..

[17]  Martin W. P. Savelsbergh,et al.  Valid inequalities for problems with additive variable upper bounds , 1999, Math. Program..

[18]  George L. Nemhauser,et al.  Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting , 2003, Math. Program..

[19]  Alper Atamtürk,et al.  Network design arc set with variable upper bounds , 2007 .

[20]  Diego Klabjan,et al.  Sequence Independent Lifting for Mixed Integer Programs with Variable Upper Bounds , 2006, Math. Program..

[21]  Laurence A. Wolsey,et al.  Valid Linear Inequalities for Fixed Charge Problems , 1985, Oper. Res..

[22]  Diego Klabjan,et al.  A Polyhedral Study of Integer Variable Upper Bounds , 2002, Math. Oper. Res..

[23]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .

[24]  Alper Atamtürk,et al.  Sequence Independent Lifting for Mixed-Integer Programming , 2004, Oper. Res..

[25]  Laurence A. Wolsey,et al.  Lifting, superadditivity, mixed integer rounding and single node flow sets revisited , 2003, 4OR.

[26]  Jean-Philippe P. Richard.  Lifting Techniques For Mixed Integer Programming , 2011 .

[27]  László Lovász,et al.  Graph Theory and Integer Programming , 1979 .

[28]  R. Weiner.  Lecture Notes in Economics and Mathematical Systems , 1985 .

[29]  Michael Jünger,et al.  Detecting symmetries by branch & cut , 2001, Math. Program..

[30]  Karen Aardal,et al.  Capacitated facility location: Separation algorithms and computational experience , 1998, Math. Program..

[31]  M. Stern,et al.  The clustering matroid and the optimal clustering tree , 2003, Math. Program..

[32]  A. Atamtūrk,et al.  Sequence Independent Lifting for Mixed-Integer Programming , 2004 .