Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization (2307.06048v1)

Published 12 Jul 2023 in math.OC, cs.LG, and stat.ML

Abstract: We study multi-product inventory control problems where a manager makes sequential replenishment decisions based on partial historical information in order to minimize its cumulative losses. Our motivation is to consider general demands, losses and dynamics to go beyond standard models which usually rely on newsvendor-type losses, fixed dynamics, and unrealistic i.i.d. demand assumptions. We propose MaxCOSD, an online algorithm that has provable guarantees even for problems with non-i.i.d. demands and stateful dynamics, including for instance perishability. We consider what we call non-degeneracy assumptions on the demand process, and argue that they are necessary to allow learning.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (36)
  1. Optimal inventory policy. Econometrica: Journal of the Econometric Society, pages 250–272, 1951.
  2. Online convex optimization with ramp constraints. In 2015 54th IEEE Conference on Decision and Control (CDC), pages 6730–6736. IEEE, 2015.
  3. On implications of demand censoring in the newsvendor problem. Management Science, 59(6):1407–1424, 2013.
  4. Adaptive ordering and pricing for perishable products. Operations Research, 48(3):436–443, 2000.
  5. The Elements of Joint Learning and Optimization in Operations Management, volume 18. Springer Nature, 2022.
  6. An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution. Management Science, 47(8):1101–1112, 2001.
  7. Ford W Harris. How many parts to make at once. 1913.
  8. Elad Hazan et al. Introduction to online convex optimization. Foundations and Trends® in Optimization, 2(3-4):157–325, 2016.
  9. A nonparametric asymptotic analysis of inventory planning with censored demand. Mathematics of Operations Research, 34(1):103–123, 2009.
  10. An adaptive algorithm for finding the optimal base-stock policy in lost sales inventory systems with censored demand. Mathematics of Operations Research, 34(2):397–416, 2009.
  11. Adaptive algorithms for online convex optimization with long-term constraints. In International Conference on Machine Learning, pages 402–411. PMLR, 2016.
  12. Provably near-optimal sampling-based policies for stochastic inventory control models. Mathematics of Operations Research, 32(4):821–839, 2007.
  13. Weak aggregating algorithm for the distribution-free perishable inventory problem. Operations Research Letters, 38(6):516–521, 2010.
  14. Cautious regret minimization: Online optimization with long-term budget constraints. In International Conference on Machine Learning, pages 3944–3952. PMLR, 2019.
  15. On the hardness of inventory management with censored demand data. arXiv preprint arXiv:1710.05739, 2017.
  16. Trading regret for efficiency: online convex optimization with long term constraints. The Journal of Machine Learning Research, 13(1):2503–2528, 2012.
  17. The m5 competition: Background, organization, and implementation. International Journal of Forecasting, 38(4):1325–1336, 2022.
  18. Online learning with sample path constraints. Journal of Machine Learning Research, 10(3), 2009.
  19. Steven Nahmias. Perishable inventory systems, volume 160. Springer Science & Business Media, 2011.
  20. Online convex optimization with time-varying constraints. arXiv preprint arXiv:1702.04783, 2017.
  21. Francesco Orabona. A modern introduction to online learning. arXiv preprint arXiv:1912.13213, 2019.
  22. Scale-free online learning. Theoretical Computer Science, 716:50–69, 2018.
  23. Herbert Scarf. Bayes solutions of the statistical inventory problem. The annals of mathematical statistics, 30(2):490–508, 1959.
  24. Online algorithms for the newsvendor problem with and without censored demands. In Frontiers in Algorithmics: 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010. Proceedings 4, pages 234–249. Springer, 2010.
  25. Nonparametric data-driven algorithms for multiproduct inventory systems with censored demand. Operations Research, 64(2):362–370, 2016.
  26. Fundamentals of supply chain theory. John Wiley & Sons, 2019.
  27. Less regret via online conditioning. arXiv preprint arXiv:1002.4862, 2010.
  28. Safety-aware algorithms for adversarial contextual bandit. In International Conference on Machine Learning, pages 3280–3288. PMLR, 2017.
  29. Roman Vershynin. High-dimensional probability: An introduction with applications in data science, volume 47. Cambridge university press, 2018.
  30. Dynamic version of the economic lot size model. Management science, 5(1):89–96, 1958.
  31. Marrying stochastic gradient descent with bandits: Learning algorithms for inventory systems with fixed costs. Management Science, 67(10):6089–6115, 2021.
  32. Perishable inventory systems: Convexity results for base-stock policies and learning algorithms under censored demand. Operations Research, 66(5):1276–1286, 2018.
  33. Closing the gap: A learning algorithm for lost-sales inventory systems with lead times. Management Science, 66(5):1962–1980, 2020.
  34. Probability-free solutions to the non-stationary newsvendor problem. Annals of Operations Research, 223(1):433–449, 2014.
  35. Distribution-free solutions to the extended multi-period newsboy problem. Journal of Industrial & Management Optimization, 13(2):633, 2017.
  36. Martin Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the 20th international conference on machine learning (icml-03), pages 928–936, 2003.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now