The Continuous Mixing Polyhedron

We analyze the polyhedral structure of the setsPCMIX = {( s, r, z) ?R XR+nXZ n|s +r j+z j=f j ,j = 1,..., n} andP+CMIX =PCMIXn{ s = 0}. The setP+CMIX is a natural generalization of the mixing set studied by Pochet and Wolsey [15, 16] and GA¼nlA¼k and Pochet [8] and recently has been introduced by Miller and Wolsey [12]. We introduce a new class of valid inequalities that has proven to be sufficient for describing conv( PCMIX). We give an extended formulation of sizeO( n) XO( n2) variables and constraints and indicate how to separate over conv( PCMIX) inO( n3) time. Finally, we show how the mixed integer rounding (MIR) inequalities of Nemhauser and Wolsey [14] and the mixing inequalities of GA¼nlA¼k and Pochet [8] constitute special cases of the cycle inequalities.

[1]  Kent Andersen,et al.  Split closure and intersection cuts , 2002, Math. Program..

[2]  William J. Cook,et al.  Chvátal closures for mixed integer programming problems , 1990, Math. Program..

[3]  Laurence A. Wolsey,et al.  Tight formulations for some simple mixed integer programs and convex objective integer programs , 2003, Math. Program..

[4]  Mathieu Van Vyve,et al.  A solution approach of production planning problems based on compact formulations for single-item lot-sizing models , 2004, 4OR.

[5]  Yongpei Guan,et al.  A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem , 2006, Math. Program..

[6]  Miguel Constantino,et al.  A cutting plane approach to capacitated lot-sizing with start-up costs , 1996, Math. Program..

[7]  Laurence A. Wolsey,et al.  Dynamic knapsack sets and capacitated lot-sizing , 2003, Math. Program..

[8]  Oktay Günlük,et al.  Mixing mixed-integer inequalities , 2001, Math. Program..

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

[10]  Laurence A. Wolsey,et al.  Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems , 2003, Oper. Res..

[11]  Laurence A. Wolsey,et al.  Lot-Sizing with Constant Batches: Formulation and Valid Inequalities , 1993, Math. Oper. Res..

[12]  Mathieu Van Vyve,et al.  Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity , 2006, Math. Program..

[13]  Shabbir Ahmed,et al.  A Multi-Stage Stochastic Integer Programming Approach for Capacity Expansion under Uncertainty , 2003, J. Glob. Optim..

[14]  Laurence A. Wolsey,et al.  Polyhedra for lot-sizing with Wagner—Whitin costs , 1994, Math. Program..

[15]  Alper Atamtürk,et al.  A study of the lot-sizing polytope , 2004, Math. Program..