IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v58y2010i3p583-594.html
   My bibliography  Save this article

Robust Approximation to Multiperiod Inventory Management

Author

Listed:
  • Chuen-Teck See

    (Department of Industrial and Systems Engineering, National University of Singapore (NUS), Singapore)

  • Melvyn Sim

    (NUS Business School, Singapore-MIT Alliance, NUS Risk Management Institute, Singapore)

Abstract

We propose a robust optimization approach to address a multiperiod inventory control problem under ambiguous demands, that is, only limited information of the demand distributions such as mean, support, and some measures of deviations. Our framework extends to correlated demands and is developed around a factor-based model, which has the ability to incorporate business factors as well as time-series forecast effects of trend, seasonality, and cyclic variations. We can obtain the parameters of the replenishment policies by solving a tractable deterministic optimization problem in the form of a second-order cone optimization problem (SOCP), with solution time; unlike dynamic programming approaches, it is polynomial and independent on parameters such as replenishment lead time, demand variability, and correlations. The proposed truncated linear replenishment policy (TLRP), which is piecewise linear with respect to demand history, improves upon static and linear policies, and achieves objective values that are reasonably close to optimal.

Suggested Citation

  • Chuen-Teck See & Melvyn Sim, 2010. "Robust Approximation to Multiperiod Inventory Management," Operations Research, INFORMS, vol. 58(3), pages 583-594, June.
    • Handle: RePEc:inm:oropre:v:58:y:2010:i:3:p:583-594
    DOI: 10.1287/opre.1090.0746
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1090.0746
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1090.0746?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
    ---><---

    References listed on IDEAS

    as
    1. William S. Lovejoy, 1990. "Myopic Policies for Some Inventory Models with Uncertain Demand Distributions," Management Science, INFORMS, vol. 36(6), pages 724-738, June.
    2. Katy S. Azoury, 1985. "Bayes Solution to Dynamic Inventory Models Under Unknown Demand Distribution," Management Science, INFORMS, vol. 31(9), pages 1150-1160, September.
    3. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    4. Stephen C. Graves, 1999. "A Single-Item Inventory Model for a Nonstationary Demand Process," Manufacturing & Service Operations Management, INFORMS, vol. 1(1), pages 50-61.
    5. Aharon Ben-Tal & Boaz Golany & Arkadi Nemirovski & Jean-Philippe Vial, 2005. "Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach," Manufacturing & Service Operations Management, INFORMS, vol. 7(3), pages 248-271, February.
    6. Dimitris Bertsimas & Ioana Popescu, 2002. "On the Relation Between Option and Stock Prices: A Convex Optimization Approach," Operations Research, INFORMS, vol. 50(2), pages 358-374, April.
    7. G. D. Johnson & H. E. Thompson, 1975. "Optimality of Myopic Inventory Policies for Certain Dependent Demand Processes," Management Science, INFORMS, vol. 21(11), pages 1303-1307, July.
    8. 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.
    9. Dimitris Bertsimas & Aurélie Thiele, 2006. "A Robust Optimization Approach to Inventory Theory," Operations Research, INFORMS, vol. 54(1), pages 150-168, February.
    10. Xiangwen Lu & Jing-Sheng Song & Amelia Regan, 2006. "Inventory Planning with Forecast Updates: Approximate Solutions and Cost Error Bounds," Operations Research, INFORMS, vol. 54(6), pages 1079-1097, December.
    11. Bruce L. Miller, 1986. "Scarf's State Reduction Method, Flexibility, and a Dependent Demand Inventory Model," Operations Research, INFORMS, vol. 34(1), pages 83-90, February.
    12. Karthik Natarajan & Dessislava Pachamanova & Melvyn Sim, 2008. "Incorporating Asymmetric Distributional Information in Robust Value-at-Risk Optimization," Management Science, INFORMS, vol. 54(3), pages 573-585, March.
    13. Warren Powell & Andrzej Ruszczyński & Huseyin Topaloglu, 2004. "Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 814-836, November.
    14. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    15. Xin Chen & Melvyn Sim & Peng Sun, 2007. "A Robust Optimization Perspective on Stochastic Programming," Operations Research, INFORMS, vol. 55(6), pages 1058-1071, December.
    16. Paul Glasserman & Sridhar Tayur, 1995. "Sensitivity Analysis for Base-Stock Levels in Multiechelon Production-Inventory Systems," Management Science, INFORMS, vol. 41(2), pages 263-281, February.
    17. Xin Chen & Melvyn Sim & Peng Sun & Jiawei Zhang, 2008. "A Linear Decision-Based Approximation Approach to Stochastic Programming," Operations Research, INFORMS, vol. 56(2), pages 344-357, April.
    18. Jing-Sheng Song & Paul Zipkin, 1993. "Inventory Control in a Fluctuating Demand Environment," Operations Research, INFORMS, vol. 41(2), pages 351-370, April.
    19. Arthur F. Veinott, Jr., 1965. "Optimal Policy for a Multi-Product, Dynamic, Nonstationary Inventory Problem," Management Science, INFORMS, vol. 12(3), pages 206-222, November.
    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. Xiangwen Lu & Jing-Sheng Song & Amelia Regan, 2006. "Inventory Planning with Forecast Updates: Approximate Solutions and Cost Error Bounds," Operations Research, INFORMS, vol. 54(6), pages 1079-1097, December.
    2. 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.
    3. 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.
    4. Yossi Aviv, 2003. "A Time-Series Framework for Supply-Chain Inventory Management," Operations Research, INFORMS, vol. 51(2), pages 210-227, April.
    5. Yossi Aviv & Awi Federgruen, 2001. "Design for Postponement: A Comprehensive Characterization of Its Benefits Under Unknown Demand Distributions," Operations Research, INFORMS, vol. 49(4), pages 578-598, August.
    6. Stephen C. Graves, 1999. "A Single-Item Inventory Model for a Nonstationary Demand Process," Manufacturing & Service Operations Management, INFORMS, vol. 1(1), pages 50-61.
    7. Yun Fong Lim & Chen Wang, 2017. "Inventory Management Based on Target-Oriented Robust Optimization," Management Science, INFORMS, vol. 63(12), pages 4409-4427, December.
    8. Joel Goh & Melvyn Sim, 2011. "Robust Optimization Made Easy with ROME," Operations Research, INFORMS, vol. 59(4), pages 973-985, August.
    9. 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.
    10. Dimitris Bertsimas & Melvyn Sim & Meilin Zhang, 2019. "Adaptive Distributionally Robust Optimization," Management Science, INFORMS, vol. 65(2), pages 604-618, February.
    11. Joel Goh & Melvyn Sim, 2010. "Distributionally Robust Optimization and Its Tractable Approximations," Operations Research, INFORMS, vol. 58(4-part-1), pages 902-917, August.
    12. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    13. Wenqing Chen & Melvyn Sim, 2009. "Goal-Driven Optimization," Operations Research, INFORMS, vol. 57(2), pages 342-357, April.
    14. Marcus Ang & Yun Fong Lim & Melvyn Sim, 2012. "Robust Storage Assignment in Unit-Load Warehouses," Management Science, INFORMS, vol. 58(11), pages 2114-2130, November.
    15. Amar Sapra & Van-Anh Truong & Rachel Q. Zhang, 2010. "How Much Demand Should Be Fulfilled?," Operations Research, INFORMS, vol. 58(3), pages 719-733, June.
    16. Haolin Ruan & Zhi Chen & Chin Pang Ho, 2023. "Adjustable Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1002-1023, September.
    17. 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.
    18. Yossi Aviv, 2001. "The Effect of Collaborative Forecasting on Supply Chain Performance," Management Science, INFORMS, vol. 47(10), pages 1326-1343, October.
    19. Zhaotong Lian & Liming Liu & Stuart X. Zhu, 2010. "Rolling‐horizon replenishment: Policies and performance analysis," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(6), pages 489-502, September.
    20. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.

    More about this item

    Keywords

    robust optimization; inventory control;

    Statistics

    Access and download statistics

    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:inm:oropre:v:58:y:2010:i:3:p:583-594. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.