Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
Abstract
A class of strong valid inequalities is described for the single-item uncapacitated economic lot-sizing problem with start-up costs. It is shown that these inequalities yield a complete polyhedral characterization of the problem. The corresponding separation problem is formulated as a shortest path problem. Finally, a reformulation as a plant location problem is shown to imply the class of strong valid inequalities, which shows that this reformulation is tight, also.
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
I. Barany, T. J. Van Roy, L. A. Wolsey, Strong formulations for multi-item capacitated lot sizing, Management Sci., 30 (1984), 1255–1261
2.
I. Barany, T. J. Van Roy, L. A. Wolsey, Uncapacitated lot-sizing: the convex hull of solutions, Math. Programming Stud., (1984), 32–43
3.
G. D. Eppen, R. K. Martin, Solving multi-item capacitated lot-sizing problems using variable redefinition, Oper. Res., 35 (1987), 268–277
4.
Bernhard Fleischmann, The discrete lot-sizing and scheduling problem, European J. Oper. Res., 44 (1990), 337–348
5.
S. van Hoesel, Ph.D. Thesis, Models and Algorithms for Single-Item Lot Sizing Problems, Econometric Institute, Erasmus University Rotterdam, the Netherlands, 1991
6.
S. van Hoesel, A. Wagelmans, A. Kolen, A dual algorithm for the economic lot-sizing problem, European J. Oper. Res., 52 (1991), 315–325
7.
U. S. Karmarkar, L. Schrage, The deterministic dynamic product cycling problem, Oper. Res., 33 (1985), 326–345
8.
J. Krarup, O. Bilde, Plant location, set covering, and economic lot-size: An o(mn) algorithm for structured problemsOptimierung bei Graphentheorietischen and Ganzzahligen Problemen, Numerische Methoden bei Optimierungsaufgaben, Vol. 3, Birkhäuser, Boston, Basel, 1977, 155–186
9.
Janny M. Y. Leung, Thomas L. Magnanti, Rita Vachani, Facets and algorithms for capacitated lot sizing, Math. Programming, 45 (1989), 331–359
10.
L. Lovász, Graph theory and integer programming, Ann. Discrete Math., 4 (1979), 141–158
11.
A. S. Manne, Programming of economic lot sizes, Management Sci., 4 (1958), 115–135
12.
Yves Pochet, Laurence A. Wolsey, Lot-size models with backlogging: strong reformulations and cutting planes, Math. Programming, 40 (1988), 317–335
13.
Y. Pochet, L. A. Wolsey, Solving multi-item lot-sizing problems using strong cutting planes, Management Sci., 37 (1991), 53–67
14.
R. L. Rardin, L. A. Wolsey, Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems, CORE Discussion Paper, 9024, Center for Operations Research and Econometrics, Louvain-la-Neuve, Belgium, 1990
15.
L. Schrage, M. A. H. Dempster, J. K. Lenstra, A. H. G. Rinnooy Kan, The multiproduct lot scheduling problem, Deterministic and Stochastic Scheduling, Nato advanced Study Institutes Series, D. Reidel, Holland, 1984
16.
L. N. van Wassenhove, P. Vanderhenst, Planning production in a bottleneck department, European J. Oper. Res., 12 (1983), 127–137
17.
H. M. Wagner, T. M. Whitin, Dynamic version of the economic lot size model, Management Sci., 5 (1958), 89–96
18.
Laurence A. Wolsey, Uncapacitated lot-sizing problems with start-up costs, Oper. Res., 37 (1989), 741–747
Information & Authors
Information
Published In
SIAM Journal on Discrete Mathematics
Pages: 141 - 151
ISSN (online): 1095-7146
Copyright
Copyright © 1994 Society for Industrial and Applied Mathematics.
History
Submitted: 6 March 1991
Accepted: 24 September 1992
Published online: 8 August 2006
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Single-item dynamic lot-sizing problems: An updated surveyEuropean Journal of Operational Research, Vol. 263, No. 3 | 1 Dec 2017
- The single-item lot-sizing polytope with continuous start-up costs and uniform production capacityAnnals of Operations Research, Vol. 235, No. 1 | 7 June 2015
- Relaxations for two-level multi-item lot-sizing problemsMathematical Programming, Vol. 146, No. 1-2 | 27 August 2013
- A polyhedral study of the single-item lot-sizing problem with continuous start-up costsElectronic Notes in Discrete Mathematics, Vol. 37 | 1 Aug 2011
- Stochastic lot-sizing problem with deterministic demands and Wagner–Whitin costsOperations Research Letters, Vol. 38, No. 5 | 1 Sep 2010
- A cutting plane algorithm for MV portfolio selection modelApplied Mathematics and Computation, Vol. 215, No. 4 | 1 Oct 2009
- LS-LIB: A Library of Tools for Solving Production Planning ProblemsResearch Trends in Combinatorial Optimization | 1 Jan 2009
- The multi-item capacitated lot-sizing problem with setup times and shortage costsEuropean Journal of Operational Research, Vol. 185, No. 3 | 1 Mar 2008
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problemMathematical Programming, Vol. 105, No. 1 | 14 March 2005
- LS-LIB: A Library of Reformulations, Cut Separation Algorithms and Primal Heuristics in a High-level Modeling Language for Solving MIP Production Planning ProblemsSSRN Electronic Journal, Vol. 30 | 1 Jan 2005
- Uncapacitated lot-sizing with buying, sales and backloggingOptimization Methods and Software, Vol. 19, No. 3-4 | 1 Jun 2004
- The Capacitated Lot-Sizing Problem with Linked Lot SizesManagement Science, Vol. 49, No. 8 | 1 Aug 2003
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and ReformulationManagement Science, Vol. 48, No. 12 | 1 Dec 2002
- Facets and Reformulations for Solving Production Planning With Changeover CostsOperations Research, Vol. 50, No. 4 | 1 Aug 2002
- A cutting plane algorithm for a single machine scheduling problemEuropean Journal of Operational Research, Vol. 127, No. 2 | 1 Dec 2000
- MIP modelling of changeovers in production planning and scheduling problemsEuropean Journal of Operational Research, Vol. 99, No. 1 | 1 May 1997
- A cutting plane approach to capacitated lot-sizing with start-up costsMathematical Programming, Vol. 75, No. 3 | 1 Dec 1996
- Polyhedral techniques in combinatorial optimization I: TheoryStatistica Neerlandica, Vol. 50, No. 1 | 29 April 2008
- Progress with single-item lot-sizingEuropean Journal of Operational Research, Vol. 86, No. 3 | 1 Nov 1995
- Chapter 9 Optimal treesNetwork Models | 1 Jan 1995
- Polyhedra for lot-sizing with Wagner—Whitin costsMathematical Programming, Vol. 67, No. 1-3 | 1 Oct 1994
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].