On the Heavy-Tail Behavior of the Distributionally Robust Newsvendor

被引:24
作者
Das, Bikramjit [1 ]
Dhara, Anulekha [2 ]
Natarajan, Karthik [1 ]
机构
[1] Singapore Univ Technol & Design, Engn Syst & Design, Singapore 487372, Singapore
[2] TCS Res, Deep Learning & Artificial Intelligence, New Delhi 201309, India
关键词
distributional robustness; newsvendor model; moment constraints; heavy-tailed distributions; BOUNDS; EXPECTATION; PRICES;
D O I
10.1287/opre.2020.2091
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Since the seminal work of Scarf (A min-max solution of an inventory problem) in 1958 on the newsvendor problem with ambiguity in the demand distribution, there has been a growing interest in the study of the distributionally robust newsvendor problem. The model is criticized at times for being conservative because the worst-case distribution is discrete with a few support points. However, it is the order quantity prescribed by the model that is of practical relevance. Interestingly, the order quantity from Scarf's model is optimal for a heavy-tailed distribution. In this paper, we generalize this observation by showing a heavy-tail optimality property of the distributionally robust order quantity for an ambiguity set where information on the first and the ath moment is known, for any real alpha > 1. We show that the optimal order quantity for the distributionally robust newsvendor is also optimal for a regularly varying distribution with parameter alpha. In the high service level regime, when the original demand distribution is given by an exponential or a lognormal distribution and contaminated with a regularly varying distribution, the distributionally robust order quantity is shown to outperform the optimal order quantity of the original distribution, even with a small amount of contamination.
引用
收藏
页码:1077 / 1099
页数:23
相关论文
共 41 条
[1]   Measuring and mitigating the costs of stockouts [J].
Anderson, Eric T. ;
Fitzsimons, Gavan J. ;
Simester, Duncan .
MANAGEMENT SCIENCE, 2006, 52 (11) :1751-1763
[2]  
[Anonymous], 2002, Comparison Methods for Stochastic Models and Risks
[3]   Robust Solutions of Optimization Problems Affected by Uncertain Probabilities [J].
Ben-Tal, Aharon ;
den Hertog, Dick ;
De Waegenaere, Anja ;
Melenberg, Bertrand ;
Rennen, Gijs .
MANAGEMENT SCIENCE, 2013, 59 (02) :341-357
[4]   MORE BOUNDS ON EXPECTATION OF A CONVEX FUNCTION OF A RANDOM VARIABLE [J].
BENTAL, A ;
HOCHMAN, E .
JOURNAL OF APPLIED PROBABILITY, 1972, 9 (04) :803-812
[5]   Optimal inequalities in probability theory: A convex optimization approach [J].
Bertsimas, D ;
Popescu, I .
SIAM JOURNAL ON OPTIMIZATION, 2005, 15 (03) :780-804
[6]   Robust sample average approximation [J].
Bertsimas, Dimitris ;
Gupta, Vishal ;
Kallus, Nathan .
MATHEMATICAL PROGRAMMING, 2018, 171 (1-2) :217-282
[7]   Inventory Pooling Under Heavy-Tailed Demand [J].
Bimpikis, Kostas ;
Markakis, Mihalis G. .
MANAGEMENT SCIENCE, 2016, 62 (06) :1800-1813
[8]  
Bingham N., 1989, Regular Variation
[9]   On distributionally robust extreme value analysis [J].
Blanchet, Jose ;
He, Fei ;
Murthy, Karthyek .
EXTREMES, 2020, 23 (02) :317-347
[10]   Quantifying Distributional Model Risk via Optimal Transport [J].
Blanchet, Jose ;
Murthy, Karthyek .
MATHEMATICS OF OPERATIONS RESEARCH, 2019, 44 (02) :565-600