On the polyhedral structure of a multi–item production planning model with setup times

Abstract. We present and study a mixed integer programming model that arises as a substructure in many industrial applications. This model generalizes a number of structured MIP models previously studied, and it provides a relaxation of various capacitated production planning problems and other fixed charge network flow problems. We analyze the polyhedral structure of the convex hull of this model, as well as of a strengthened LP relaxation. Among other results, we present valid inequalities that induce facets of the convex hull under certain conditions. We also discuss how to strengthen these inequalities by using known results for lifting valid inequalities for 0–1 continuous knapsack problems.

[1]  Laurence A. Wolsey,et al.  Solving Mixed Integer Programming Problems Using Automatic Reformulation , 1987, Oper. Res..

[2]  William W. Trigeiro,et al.  Capacitated lot sizing with setup times , 1989 .

[3]  Laurence A. Wolsey,et al.  Strong Formulations for Multi-Item Capacitated Lot Sizing , 1984 .

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

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

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

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

[8]  Martin W. P. Savelsbergh,et al.  On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra , 2000, Eur. J. Oper. Res..

[9]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

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

[11]  Laurence A. Wolsey,et al.  Multi-item lot-sizing problems using strong cutting planes , 1991 .

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

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

[14]  Richard M. Karp,et al.  On linear characterizations of combinatorial optimization problems , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[15]  Laurence A. Wolsey,et al.  Uncapacitated lot-sizing: The convex hull of solutions , 1984 .

[16]  Martin W. P. Savelsbergh,et al.  A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case , 2003, Math. Program..

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

[18]  G. Nemhauser,et al.  Solving Multi-Item Capacitated Lot-Sizing Problems with Setup Times by Branch-and-Cut , 2000 .

[19]  Andrew J. Miller.  Polyhedral approaches to capacitated lot-sizing problems , 1999 .