Name
Abstract | ||
|---|---|---|
Abstract In this paper a general methodology is proposed based on robust optimization for an inventory control problem subject to uncertain demands and uncertain lead times. Several lead time uncertainty sets are proposed based on the budget uncertainty set, and a set based on the central limit theorem. Robust optimization models are developed for a periodic review, finite horizon inventory control problem subject to uncertain demands and uncertain lead times. We develop an approach based on Benders’ decomposition to compute optimal robust (i.e., best worst-case) policy parameters. The proposed approach does not assume distributional knowledge, makes no assumption regarding order crossovers, and is tractable in a practical sense. Comparing the new approach to an epigraph reformulation method, we demonstrate that the epigraph reformulation approach is overly conservative even when costs are stationary. The approach is benchmarked against the sample average approximation (SAA) method. Computational results indicate that the approach provides more stable and robust solutions compared to SAA in terms of standard deviation and worst-case solution, especially when the realized distribution is different than the sampled distribution. |
Year | DOI | Venue |
|---|---|---|
2017 | https://doi.org/10.1007/s10479-015-2084-1 | Annals of Operations Research |
Keywords | Field | DocType |
Robust optimization,Inventory control,Lead time uncertainty,Demand uncertainty | Mathematical optimization,Central limit theorem,Robust optimization,Inventory control,Lead time,Epigraph,Finite horizon,Periodic graph (geometry),Standard deviation,Mathematics | Journal |
Volume | Issue | ISSN |
257 | 1 | 0254-5330 |
Citations | PageRank | References |
5 | 0.43 | 23 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andreas Thorsen | 1 | 9 | 0.82 |
| Tao Yao | 2 | 39 | 5.33 |