The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach
Abstract
We propose the use of robust optimization (RO) as a powerful methodology for multiperiod stochastic operations management problems. In particular, we study a two-echelon multiperiod supply chain problem, known as the retailer-supplier flexible commitment (RSFC) problem with uncertain demand that is only known to reside in some uncertainty set. We adopt a min-max criterion, whereby the cost function is minimized against the worst case demand occurrence. To solve the min-max RSFC problem we employ a recent extension of the RO method adapted to dynamic decision problems and known as the affinely adjustable robust counterpart (AARC) methodology. The AARC solution is tested by a large simulation study and found to provide excellent results.
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
Information Distortion in a Supply Chain: The Bullwhip Effect
Lee, H. L., Padmanabhan, V., & Whang, S. (1997) · Management Science · doi:10.1287/mnsc.43.4.546 · Cited by 4,698
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5086 · Cited by 3,515
Robust 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
Self-citationMATHEMATICAL METHODS IN THE SOCIAL SCIENCES, 1959
Karlin, S., & Suppes, P. (1960) · Cited by 1,689
Neuro-Dynamic Programming: NDP
Bertsekas, D. P. (2001) · Encyclopedia of Optimization · doi:10.1007/0-306-48332-7_333 · Cited by 1,466
Robust optimization ? methodology and applications
Ben-Tal, A., & Nemirovski, A. (2002) · Mathematical Programming · doi:10.1007/s101070100286 · Cited by 1,409
Self-citationAdjustable robust solutions of uncertain linear programs
Ben-Tal, A., Goryashko, A., Guslitzer, E., & Nemirovski, A. (2004) · Mathematical Programming · doi:10.1007/s10107-003-0454-y · Cited by 1,380
Self-citationPlanning Production, Inventories, and Work Force.
Mills, E. S., Holt, C. C., Modigliani, F., Muth, J. F., & Simon, H. A. (1962) · Journal of the American Statistical Association · doi:10.2307/2282461 · Cited by 877
Adjustable robust solutions of uncertain linear programs
Ben-TalA., GoryashkoA., GuslitzerE., et al. (2004) · Mathematical Programming · doi:10.5555/2990016.3114320 · Cited by 849
The Optimality of (S,s) Policies in the Dynamic Inventory Problem
Scarf, H. (2005) · Herbert Scarf’s Contributions to Economics, Game Theory and Operations Research · doi:10.1057/9781137024381_1 · Cited by 712
Iyengar, G. N. (2005) · Mathematics of Operations Research · doi:10.1287/moor.1040.0129 · Cited by 566
An Analysis of Bid-Price Controls for Network Revenue Management
Talluri, K., & van Ryzin, G. (1998) · Management Science · doi:10.1287/mnsc.44.11.1577 · Cited by 412
Quantity Flexibility Contracts and Supply Chain Performance
Tsay, A. A., & Lovejoy, W. S. (1999) · Manufacturing & Service Operations Management · doi:10.1287/msom.1.2.89 · Cited by 398
Robust Truss Topology Design via Semidefinite Programming
Ben-Tal, A., & Nemirovski, A. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623495291951 · Cited by 378
Self-citationGeneralized polynomial approximations in Markovian decision processes
Schweitzer, P. J., & Seidmann, A. (1985) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(85)90317-8 · Cited by 330
The Status of Mathematical Inventory Theory
Veinott, A. F. (1966) · Management Science · doi:10.1287/mnsc.12.11.745 · Cited by 265
Perishable Asset Revenue Management with Markovian Time Dependent Demand Intensities
Feng, Y., & Gallego, G. (2000) · Management Science · doi:10.1287/mnsc.46.7.941.12035 · Cited by 146
Perishable Asset Revenue Management with Markovian Time Dependent Demand Intensities
FengYouyi, & GallegoGuillermo (2000) · Management Science · Cited by 101
Free Material Design via Semidefinite Programming: The Multiload Case with Contact Conditions
Ben‐Tal, A., Kočvara, M., Nemirovski, A. S., & Zowe, J. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623497327994 · Cited by 56
Self-citationvan Delft, C., & Vial, J.-P. (2004) · Automatica · doi:10.1016/j.automatica.2003.12.008 · Cited by 48
Self-citation
Cited by
A practical guide to robust optimization
Gorissen, B. L., Yanıkoğlu, İ., & den Hertog, D. (2015) · Omega · doi:10.1016/j.omega.2014.12.006 · Cited by 636
Data-driven robust optimization
Bertsimas, D., Gupta, V., & Kallus, N. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1125-8 · Cited by 611
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
A 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
On Complexity of Stochastic Programming Problems
Shapiro, A., & Nemirovski, A. (2006) · Applied Optimization · doi:10.1007/0-387-26771-9_4 · Cited by 301
Self-citation
Metadata
- Authors
- Ben-Tal, A., Golany, B., Nemirovski, A., & Vial, J.-P.
- Venue
- Manufacturing & Service Operations Management
- Published
- 2005-07
- Volume
- 7
- Issue
- 3
- Pages
- 248-271
- ISSN
- 1523-4614 (ISSN-L)
- 1526-5498
- OpenAlex
- W2108434419
- Cited by
- 322
- References
- 20
- FWCI
- 8.54
- 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.