IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v321y2023i1d10.1007_s10479-022-04932-9.html
   My bibliography  Save this article

Inventory control with modulated demand and a partially observed modulation process

Author

Listed:
  • Satya S. Malladi

    (Kantar Analytics Practice)

  • Alan L. Erera

    (Georgia Institute of Technology)

  • Chelsea C. White

    (Georgia Institute of Technology)

Abstract

We consider a periodic review inventory control problem having an underlying modulation process that affects demand and that is partially observed by the uncensored demand process and a novel additional observation data (AOD) process. We present an attainability condition, AC, that guarantees the existence of an optimal myopic base stock policy if the reorder cost $$K=0$$ K = 0 and the existence of an optimal (s, S) policy if $$K>0$$ K > 0 , where both policies depend on the belief function of the modulation process. Assuming AC holds, we show that (i) when $$K=0$$ K = 0 , the value of the optimal base stock level is constant within regions of the belief space and that each region can be described by two linear inequalities and (ii) when $$K>0$$ K > 0 , the values of s and S and upper and lower bounds on these values are constant within regions of the belief space and that these regions can be described by a finite set of linear inequalities. A heuristic and bounds for the $$K=0$$ K = 0 case are presented when AC does not hold. Special cases of this inventory control problem include problems considered in the Markov-modulated demand and Bayesian updating literatures.

Suggested Citation

  • Satya S. Malladi & Alan L. Erera & Chelsea C. White, 2023. "Inventory control with modulated demand and a partially observed modulation process," Annals of Operations Research, Springer, vol. 321(1), pages 343-369, February.
  • Handle: RePEc:spr:annopr:v:321:y:2023:i:1:d:10.1007_s10479-022-04932-9
    DOI: 10.1007/s10479-022-04932-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-04932-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-022-04932-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gah-Yi Ban & Cynthia Rudin, 2019. "The Big Data Newsvendor: Practical Insights from Machine Learning," Operations Research, INFORMS, vol. 67(1), pages 90-108, January.
    2. Suresh P. Sethi & Feng Cheng, 1997. "Optimality of ( s , S ) Policies in Inventory Models with Markovian Demand," Operations Research, INFORMS, vol. 45(6), pages 931-939, December.
    3. Gah-Yi Ban, 2020. "Confidence Intervals for Data-Driven Inventory Policies with Demand Censoring," Operations Research, INFORMS, vol. 68(2), pages 309-326, March.
    4. William S. Lovejoy, 1990. "Myopic Policies for Some Inventory Models with Uncertain Demand Distributions," Management Science, INFORMS, vol. 36(6), pages 724-738, June.
    5. Katy S. Azoury, 1985. "Bayes Solution to Dynamic Inventory Models Under Unknown Demand Distribution," Management Science, INFORMS, vol. 31(9), pages 1150-1160, September.
    6. Khouja, Moutaz, 1999. "The single-period (news-vendor) problem: literature review and suggestions for future research," Omega, Elsevier, vol. 27(5), pages 537-553, October.
    7. William S. Lovejoy, 1992. "Stopped Myopic Policies in Some Inventory Models with Generalized Demand Processes," Management Science, INFORMS, vol. 38(5), pages 688-707, May.
    8. Hamed Mamani & Shima Nassiri & Michael R. Wagner, 2017. "Closed-Form Solutions for Robust Inventory Management," Management Science, INFORMS, vol. 63(5), pages 1625-1643, May.
    9. Michael N. Katehakis & Benjamin Melamed & Jim (Junmin) Shi, 2016. "Cash-Flow Based Dynamic Inventory Management," Production and Operations Management, Production and Operations Management Society, vol. 25(9), pages 1558-1575, September.
    10. Omar Besbes & Alp Muharremoglu, 2013. "On Implications of Demand Censoring in the Newsvendor Problem," Management Science, INFORMS, vol. 59(6), pages 1407-1424, June.
    11. Paul Zipkin, 1989. "Critical Number Policies for Inventory Models with Periodic Data," Management Science, INFORMS, vol. 35(1), pages 71-80, January.
    12. Guillermo Gallego & Haichao Hu, 2004. "Optimal Policies for Production/Inventory Systems with Finite Capacity and Markov-Modulated Demand and Supply Processes," Annals of Operations Research, Springer, vol. 126(1), pages 21-41, February.
    13. Donald L. Iglehart, 1963. "Optimality of (s, S) Policies in the Infinite Horizon Dynamic Inventory Problem," Management Science, INFORMS, vol. 9(2), pages 259-267, January.
    14. Woonghee Tim Huh & Ganesh Janakiraman & John A. Muckstadt & Paat Rusmevichientong, 2009. "An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 397-416, May.
    15. Martin A. Lariviere & Evan L. Porteus, 1999. "Stalking Information: Bayesian Inventory Management with Unobserved Lost Sales," Management Science, INFORMS, vol. 45(3), pages 346-363, March.
    16. Georgia Perakis & Guillaume Roels, 2008. "Regret in the Newsvendor Model with Partial Information," Operations Research, INFORMS, vol. 56(1), pages 188-203, February.
    17. Katy S. Azoury & Bruce L. Miller, 1984. "A Comparison of the Optimal Ordering Levels of Bayesian and Non-Bayesian Inventory Models," Management Science, INFORMS, vol. 30(8), pages 993-1003, August.
    18. Huanan Zhang & Xiuli Chao & Cong Shi, 2020. "Closing the Gap: A Learning Algorithm for Lost-Sales Inventory Systems with Lead Times," Management Science, INFORMS, vol. 66(5), pages 1962-1980, May.
    19. Arthur F. Veinott, Jr. & Harvey M. Wagner, 1965. "Computing Optimal (s, S) Inventory Policies," Management Science, INFORMS, vol. 11(5), pages 525-552, March.
    20. Woonghee Tim Huh & Retsef Levi & Paat Rusmevichientong & James B. Orlin, 2011. "Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator," Operations Research, INFORMS, vol. 59(4), pages 929-941, August.
    21. Richard D. Smallwood & Edward J. Sondik, 1973. "The Optimal Control of Partially Observable Markov Processes over a Finite Horizon," Operations Research, INFORMS, vol. 21(5), pages 1071-1088, October.
    22. Xiaomei Ding & Martin L. Puterman & Arnab Bisi, 2002. "The Censored Newsvendor and the Optimal Acquisition of Information," Operations Research, INFORMS, vol. 50(3), pages 517-527, June.
    23. Qin, Yan & Wang, Ruoxuan & Vakharia, Asoo J. & Chen, Yuwen & Seref, Michelle M.H., 2011. "The newsvendor problem: Review and directions for future research," European Journal of Operational Research, Elsevier, vol. 213(2), pages 361-374, September.
    24. Erhan Bayraktar & Michael Ludkovski, 2010. "Inventory management with partially observed nonstationary demand," Annals of Operations Research, Springer, vol. 176(1), pages 7-39, April.
    25. Lucy Gongtao Chen & Lawrence W. Robinson & Robin O. Roundy & Rachel Q. Zhang, 2015. "Technical Note—New Sufficient Conditions for ( s, S ) Policies to be Optimal in Systems with Multiple Uncertainties," Operations Research, INFORMS, vol. 63(1), pages 186-197, February.
    26. James T. Treharne & Charles R. Sox, 2002. "Adaptive Inventory Control for Nonstationary Demand and Partial Information," Management Science, INFORMS, vol. 48(5), pages 607-624, May.
    27. Jing-Sheng Song & Paul Zipkin, 1993. "Inventory Control in a Fluctuating Demand Environment," Operations Research, INFORMS, vol. 41(2), pages 351-370, April.
    28. Yanling Chang & Alan Erera & Chelsea White, 2015. "Value of information for a leader–follower partially observed Markov game," Annals of Operations Research, Springer, vol. 235(1), pages 129-153, December.
    29. Nicholas C. Petruzzi & Maqbool Dada, 1999. "Pricing and the Newsvendor Problem: A Review with Extensions," Operations Research, INFORMS, vol. 47(2), pages 183-194, April.
    30. Alain Bensoussan & Metin Çakanyıldırım & Suresh P. Sethi, 2007. "A Multiperiod Newsvendor Problem with Partially Observed Demand," Mathematics of Operations Research, INFORMS, vol. 32(2), pages 322-344, May.
    31. Thomas E. Morton, 1978. "The Nonstationary Infinite Horizon Inventory Problem," Management Science, INFORMS, vol. 24(14), pages 1474-1482, October.
    32. Michael Katehakis & Laurens Smit, 2012. "On computing optimal (Q,r) replenishment policies under quantity discounts," Annals of Operations Research, Springer, vol. 200(1), pages 279-298, November.
    33. Retsef Levi & Georgia Perakis & Joline Uichanco, 2015. "The Data-Driven Newsvendor Problem: New Bounds and Insights," Operations Research, INFORMS, vol. 63(6), pages 1294-1306, December.
    34. Arthur F. Veinott, 1965. "Optimal Policy in a Dynamic, Single Product, Nonstationary Inventory Model with Several Demand Classes," Operations Research, INFORMS, vol. 13(5), pages 761-778, October.
    35. Dimitris Bertsimas & Nathan Kallus, 2020. "From Predictive to Prescriptive Analytics," Management Science, INFORMS, vol. 66(3), pages 1025-1044, March.
    36. Arifoglu, Kenan & Özekici, Süleyman, 2010. "Optimal policies for inventory systems with finite capacity and partially observed Markov-modulated demand and supply processes," European Journal of Operational Research, Elsevier, vol. 204(3), pages 421-438, August.
    37. Gregory A. Godfrey & Warren B. Powell, 2001. "An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution," Management Science, INFORMS, vol. 47(8), pages 1101-1112, August.
    38. Satya S. Malladi & Alan L. Erera & Chelsea C. White, 2021. "Managing mobile production-inventory systems influenced by a modulation process," Annals of Operations Research, Springer, vol. 304(1), pages 299-330, September.
    39. Edward J. Sondik, 1978. "The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs," Operations Research, INFORMS, vol. 26(2), pages 282-304, April.
    40. Woonghee Tim Huh & Paat Rusmevichientong, 2009. "A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 103-123, February.
    41. Wang Chi Cheung & David Simchi-Levi, 2019. "Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 668-692, May.
    42. George R. Murray, Jr. & Edward A. Silver, 1966. "A Bayesian Analysis of the Style Goods Inventory Problem," Management Science, INFORMS, vol. 12(11), pages 785-797, July.
    43. A. Bensoussan & M. Çakanyıldırım & J. A. Minjárez-Sosa & A. Royal & S. P. Sethi, 2008. "Inventory Problems with Partially Observed Demands and Lost Sales," Journal of Optimization Theory and Applications, Springer, vol. 136(3), pages 321-340, March.
    44. Yanling Chang & Alan Erera & Chelsea White, 2015. "A leader–follower partially observed, multiobjective Markov game," Annals of Operations Research, Springer, vol. 235(1), pages 103-128, December.
    45. Kris Johnson Ferreira & Bin Hong Alex Lee & David Simchi-Levi, 2016. "Analytics for an Online Retailer: Demand Forecasting and Price Optimization," Manufacturing & Service Operations Management, INFORMS, vol. 18(1), pages 69-88, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gen Sakoda & Hideki Takayasu & Misako Takayasu, 2019. "Data Science Solutions for Retail Strategy to Reduce Waste Keeping High Profit," Sustainability, MDPI, vol. 11(13), pages 1-30, June.
    2. Pirayesh Neghab, Davood & Khayyati, Siamak & Karaesmen, Fikri, 2022. "An integrated data-driven method using deep learning for a newsvendor problem with unobservable features," European Journal of Operational Research, Elsevier, vol. 302(2), pages 482-496.
    3. Hao Yuan & Qi Luo & Cong Shi, 2021. "Marrying Stochastic Gradient Descent with Bandits: Learning Algorithms for Inventory Systems with Fixed Costs," Management Science, INFORMS, vol. 67(10), pages 6089-6115, October.
    4. Gah-Yi Ban, 2020. "Confidence Intervals for Data-Driven Inventory Policies with Demand Censoring," Operations Research, INFORMS, vol. 68(2), pages 309-326, March.
    5. Harun Avci & Kagan Gokbayrak & Emre Nadar, 2020. "Structural Results for Average‐Cost Inventory Models with Markov‐Modulated Demand and Partial Information," Production and Operations Management, Production and Operations Management Society, vol. 29(1), pages 156-173, January.
    6. Serrano, Breno & Minner, Stefan & Schiffer, Maximilian & Vidal, Thibaut, 2024. "Bilevel optimization for feature selection in the data-driven newsvendor problem," European Journal of Operational Research, Elsevier, vol. 315(2), pages 703-714.
    7. Woonghee Tim Huh & Paat Rusmevichientong, 2009. "A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 103-123, February.
    8. Boxiao Chen & Xiuli Chao & Cong Shi, 2021. "Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 726-756, May.
    9. Erhan Bayraktar & Michael Ludkovski, 2010. "Inventory management with partially observed nonstationary demand," Annals of Operations Research, Springer, vol. 176(1), pages 7-39, April.
    10. Erkip, Nesim Kohen, 2023. "Can accessing much data reshape the theory? Inventory theory under the challenge of data-driven systems," European Journal of Operational Research, Elsevier, vol. 308(3), pages 949-959.
    11. Gah-Yi Ban & Cynthia Rudin, 2019. "The Big Data Newsvendor: Practical Insights from Machine Learning," Operations Research, INFORMS, vol. 67(1), pages 90-108, January.
    12. Boxiao Chen & David Simchi-Levi & Yining Wang & Yuan Zhou, 2022. "Dynamic Pricing and Inventory Control with Fixed Ordering Cost and Incomplete Demand Information," Management Science, INFORMS, vol. 68(8), pages 5684-5703, August.
    13. Boxiao Chen & Xiuli Chao, 2020. "Dynamic Inventory Control with Stockout Substitution and Demand Learning," Management Science, INFORMS, vol. 66(11), pages 5108-5127, November.
    14. Jinzhi Bu & David Simchi-Levi & Li Wang, 2023. "Offline Pricing and Demand Learning with Censored Data," Management Science, INFORMS, vol. 69(2), pages 885-903, February.
    15. Cong Shi & Weidong Chen & Izak Duenyas, 2016. "Technical Note—Nonparametric Data-Driven Algorithms for Multiproduct Inventory Systems with Censored Demand," Operations Research, INFORMS, vol. 64(2), pages 362-370, April.
    16. Anyan Qi & Hyun-Soo Ahn & Amitabh Sinha, 2017. "Capacity Investment with Demand Learning," Operations Research, INFORMS, vol. 65(1), pages 145-164, February.
    17. Boxiao Chen, 2021. "Data‐Driven Inventory Control with Shifting Demand," Production and Operations Management, Production and Operations Management Society, vol. 30(5), pages 1365-1385, May.
    18. Rui Wang & Xiao Yan & Chuanjin Zhu, 2023. "Solving a Distribution-Free Multi-Period Newsvendor Problem With Advance Purchase Discount via an Online Ordering Solution," SAGE Open, , vol. 13(2), pages 21582440231, June.
    19. Katy S. Azoury & Julia Miyaoka, 2009. "Optimal Policies and Approximations for a Bayesian Linear Regression Inventory Model," Management Science, INFORMS, vol. 55(5), pages 813-826, May.
    20. Anyan Qi & Hyun-Soo Ahn & Amitabh Sinha, 2017. "Capacity Investment with Demand Learning," Operations Research, INFORMS, vol. 65(1), pages 145-164, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:321:y:2023:i:1:d:10.1007_s10479-022-04932-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.