Metraipolis › archive › dc_3d59fa30c73f
Improved Approximation Guarantees for Periodic-Review Stochastic Inventory Control — arXiv:2610.41475
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41475
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T07:57:50.383Z
- SHA-256 of the archived text
39e278f759b08c03726079469642c63970d177ed5bfc76cfff0e6927d7abfda7- Stable URL of this page
https://metraipolis.com/documento/dc_3d59fa30c73f
How to cite
Improved Approximation Guarantees for Periodic-Review Stochastic Inventory Control — arXiv:2610.41475 — arXiv (en), https://arxiv.org/abs/2610.41475 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3d59fa30c73f (Metraipolis archive dc_3d59fa30c73f, sha256 39e278f759b08c03726079469642c63970d177ed5bfc76cfff0e6927d7abfda7)
BibTeX
@misc{dc3d59fa30c73f,
title = {Improved Approximation Guarantees for Periodic-Review Stochastic Inventory Control — arXiv:2610.41475},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41475},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3d59fa30c73f; sha256 39e278f759b08c03726079469642c63970d177ed5bfc76cfff0e6927d7abfda7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41475. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In periodic-review stochastic inventory control, replenishment policies must balance holding and backlogging costs while responding to uncertain demands and evolving forecasts that may be arbitrarily correlated and nonstationary. In this general information setting, Levi, P{á}l, Roundy, and Shmoys (Mathematics of Operations Research 2007) established that the fully adaptive optimum can be approximated within factor $2$, which had remained the best-known performance guarantee since then. Their marginal cost accounting and dual-balancing framework made this comparison possible without computing optimal decisions across future trajectories, opening a broad research program on approximation algorithms for stochastic inventory systems. We break this long-standing barrier for periodic-review stochastic inventory control, showing how to compete against the fully adaptive benchmark within factor $\frac{ e }{ e-1 } \approx 1.582$ while retaining general demand correlations and evolving forecasts. We attain these advances by discovering a structural connection between marginal inventory accounting and weighted stopping problems, where each unit's conditional holding charge forms a supermartingale, while postponing its order incurs a history-dependent backlog charge. To leverage the random thresholding approach of Ma and Tzamos (ICML 2023) in this context, we develop a potential-function analysis, leading to an $\frac{ e }{ e-1 }$-approximation with respect to any unit's stopping problem. Subsequently, our common-threshold policy coordinates these marginal decisions into a global replenishment policy without additional loss.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.41475 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-02T07:41:45.724Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).