Formulations for dynamic lot sizing with service levels

DOI10.1002/nav.21519zbMath1407.90016OpenAlexW1972934230MaRDI QIDQ3120588

Simge Küçükyavuz, Dinakar Gade

Publication date: 5 March 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21519

zbMATH Keywords

shortest pathslot sizingextended formulationservice levelsfixed-charge networks

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)

Related Items (6)

A reformulation for the stochastic lot sizing problem with service-level constraints ⋮ Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems ⋮ A graph-based decomposition method for convex quadratic optimization with indicators ⋮ A polyhedral study of the static probabilistic lot-sizing problem ⋮ Ambiguous risk constraints with moment and unimodality information ⋮ On the structure of linear programs with overlapping cardinality constraints

This page was built for publication: Formulations for dynamic lot sizing with service levels