A Robust Optimization Approach to Inventory Theory
The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Abstract
We propose a general methodology based on robust optimization to address the problem of optimally controlling a supply chain subject to stochastic demand in discrete time. This problem has been studied in the past using dynamic programming, which suffers from dimensionality problems and assumes full knowledge of the demand distribution. The proposed approach takes into account the uncertainty of the demand in the supply chain without assuming a specific distribution, while remaining highly tractable and providing insight into the corresponding optimal policy. It also allows adjustment of the level of robustness of the solution to trade off performance and protection against uncertainty. An attractive feature of the proposed approach is its numerical tractability, especially when compared to multidimensional dynamic programming problems in complex supply chains, as the robust problem is of the same difficulty as the nominal problem, that is, a linear programming problem when there are no fixed costs, and a mixed-integer programming problem when fixed costs are present. Furthermore, we show that the optimal policy obtained in the robust approach is identical to the optimal policy obtained in the nominal case for a modified and explicitly computable demand sequence. In this way, we show that the structure of the optimal robust policy is of the same base-stock character as the optimal stochastic policy for a wide range of inventory problems in single installations, series systems, and general supply chains. Preliminary computational results are very promising.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1995) · Cited by 10,558
Bertsimas, D., & Sim, M. (2004) · Operations Research · doi:10.1287/opre.1030.0065 · Cited by 4,557
Self-citation(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5086 · Cited by 3,515
Ben-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
Foundations of Inventory Management
Zipkin, P. H. (2000) · Medical Entomology and Zoology · Cited by 1,854
Robust solutions of uncertain linear programs
Ben-Tal, A., & Nemirovski, A. (1999) · Operations Research Letters · doi:10.1016/s0167-6377(99)00016-4 · Cited by 1,829
Soyster, A. L. (1973) · Operations Research · doi:10.1287/opre.21.5.1154 · Cited by 1,822
Robust discrete optimization and network flows
Bertsimas, D., & Sim, M. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0396-4 · Cited by 1,799
Self-citationRobust solutions of Linear Programming problems contaminated with uncertain data
Ben-Tal, A., & Nemirovski, A. (2000) · Mathematical Programming · doi:10.1007/pl00011380 · Cited by 1,744
Neuro-Dynamic Programming: NDP
Bertsekas, D. P. (2001) · Encyclopedia of Optimization · doi:10.1007/0-306-48332-7_333 · Cited by 1,466
Cited by
Distributionally Robust Optimization and Its Tractable Approximations
Goh, J., & Sim, M. (2010) · Operations Research · doi:10.1287/opre.1090.0795 · Cited by 668
A Robust Optimization Perspective on Stochastic Programming
Chen, X., Sim, M., & Sun, P. (2007) · Operations Research · doi:10.1287/opre.1070.0441 · Cited by 362
Optimal Operation and Services Scheduling for an Electric Vehicle Battery Swapping Station
Sarker, M. R., Pandzic, H., & Ortega-Vazquez, M. A. (2015) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2014.2331560 · Cited by 358
Two-Stage Robust Network Flow and Design Under Demand Uncertainty
Atamtürk, A., & Zhang, M. (2007) · Operations Research · doi:10.1287/opre.1070.0428 · Cited by 340
Adaptive Distributionally Robust Optimization
Bertsimas, D., Sim, M., & Zhang, M. (2019) · Management Science · doi:10.1287/mnsc.2017.2952 · Cited by 326
Self-citationA unified framework for stochastic optimization
Powell, W. B. (2019) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.07.014 · Cited by 314
Robust and Data-Driven Optimization: Modern Decision Making Under Uncertainty
Bertsimas, D., & Thiele, A. (2006) · Models, Methods, and Applications for Innovative Decision Making · doi:10.1287/educ.1063.0022 · Cited by 280
Self-citationIncreasing Supply Chain Robustness through Process Flexibility and Inventory
Simchi‐Levi, D., Wang, H., & Wei, Y. (2018) · Production and Operations Management · doi:10.1111/poms.12887 · Cited by 273
The Data-Driven Newsvendor Problem: New Bounds and Insights
Levi, R., Perakis, G., & Uichanco, J. (2015) · Operations Research · doi:10.1287/opre.2015.1422 · Cited by 256
Deep reinforcement learning for inventory control: A roadmap
Boute, R. N., Gijsbrechts, J., van Jaarsveld, W., & Vanvuchelen, N. (2022) · European Journal of Operational Research · doi:10.1016/j.ejor.2021.07.016 · Cited by 235
Yan, Y., Chow, A. H. F., Ho, C. P., Kuo, Y.-H., Wu, Q., & Ying, C. (2022) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2022.102712 · Cited by 214
Robust Approximation to Multiperiod Inventory Management
See, C.-T., & Sim, M. (2010) · Operations Research · doi:10.1287/opre.1090.0746 · Cited by 194
“Sampling-based approximation has been applied to the inventory control problem; see, for instance, Levi et al. (2007a). Using marginal cost accounting and cost-balancing techniques, Levi et al.”
MethodInfluentialTheory and applications of robust optimization
Bertsimas, D., Brown, D. B., & Caramanis, C. (2011) · SIAM Review · doi:10.1137/080734510 · Cited by 134
Self-citationRobust earth observation satellite scheduling with uncertainty of cloud coverage
Wang, X., Song, G., Leus, R., & Han, C. (2020) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2019.2947978 · Cited by 70
Optimal Multiperiod Pricing with Service Guarantees
Borgs, C., Candogan, O., Chayes, J., Lobel, I., & Nazerzadeh, H. (2014) · Management Science · doi:10.1287/mnsc.2013.1839 · Cited by 60
“First, we consider a robust optimization framework (see Ben-Tal and Nemirovski 2002, Bertsimas and Thiele 2006), where there is uncertainty about the firm’s capacity and the size of the customer population at any given period, and the firm only knows that these parameters belong to given sets.”
BackgroundMethod
Metadata
- Authors
- Bertsimas, D., & Thiele, A.
- Venue
- Operations Research
- Published
- 2006-02
- Volume
- 54
- Issue
- 1
- Pages
- 150-168
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2045271791
- Cited by
- 705
- References
- 24
- FWCI
- 36.82
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.