On the heavy-tail behavior of the distributionally robust newsvendor

DOI10.1287/OPRE.2020.2091MaRDI QIDQ5031607zbMATH OpenOpenAlexFDO

Authors Bikramjit Das, Anulekha Dhara, Karthik Natarajan

Publication date 16 February 2022

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1806.05379

zbMATH Keywords

convex programmingnewsvendor modelinventorystochastic modelsheavy-tailed distributionsdistributional robustnessmoment constraintsdistribution comparisons

Mathematics Subject Classification ID

Convex programming (90C25) Inventory, storage, reservoirs (90B05)

Abstract: Since the seminal work of Scarf (1958) [A min-max solution of an inventory problem, Studies in the Mathematical Theory of Inventory and Production, pages 201-209] 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 overly conservative since the worst-case distribution is discrete with a few support points. However, it is the order quantity prescribed from the model that is of practical relevance. A simple calculation shows that the optimal order quantity in Scarf's model with known first and second moment is also optimal for a censored student-t distribution with parameter 2. In this paper, we generalize this "heavy-tail optimality" property of the distributionally robust newsvendor to an ambiguity set where information on the first and the $alpha$th moment is known, for any real number $alpha>1$. We show that the optimal order quantity for the distributionally robust newsvendor problem is also optimal for a regularly varying distribution with roughly a power law tail with tail index $alpha$. We illustrate the usefulness of the model in the high service level regime with numerical experiments, by showing that when a standard distribution such as the exponential or lognormal distribution is contaminated with a heavy-tailed (regularly varying) distribution, the distributionally robust optimal order quantity outperforms the optimal order quantity of the original distribution, even with a small amount of contamination.

Recommendations

• Controlling risk and demand ambiguity in newsvendor models
• Distributionally robust multi-item newsvendor problems with multimodal demand distributions
• Robust newsvendor problems with compound Poisson demands
• Robust newsvendor problems: effect of discrete demands
• Robust optimization for the newsvendor problem with discrete demand

Cites work

• scientific article; zbMATH DE number 3130649 (Why is no real title available?)
• scientific article; zbMATH DE number 43570 (Why is no real title available?)
• scientific article; zbMATH DE number 1026574 (Why is no real title available?)
• scientific article; zbMATH DE number 1489808 (Why is no real title available?)
• scientific article; zbMATH DE number 5242364 (Why is no real title available?)
• scientific article; zbMATH DE number 3359478 (Why is no real title available?)
• A bootstrap method to test for the existence of finite moments
• Bounds on measures satisfying moment conditions.
• Comparison methods for stochastic models and risks
• Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
• Likelihood robust optimization for data-driven problems
• Measuring and mitigating the costs of stockouts
• Minimax analysis of stochastic problems
• More bounds on the expectation of a convex function of a random variable
• New bounds and heuristics for \((Q,r)\) policies
• On a Class of Minimax Stochastic Programs
• On distributionally robust extreme value analysis
• Optimal Inequalities in Probability Theory: A Convex Optimization Approach
• Power-law distributions in empirical data
• Quantifying distributional model risk via optimal transport
• Relative entropy relaxations for signomial optimization
• Robust sample average approximation
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Second order regular variation and conditional tail expectation of multiple risks
• Solving semidefinite-quadratic-linear programs using SDPT3
• Stability in stochastic programming with recourse. Contaminated distributions
• Stochastic orders
• Tail analysis without parametric models: a worst-case perspective
• The Distribution Free Newsboy Problem: Review and Extensions
• Third-order extensions of Lo's semiparametric bound for European call options
• Tight bounds for some risk measures, with applications to robust portfolio selection
• Upper bounds on stop-loss premiums in case of known moments up to the fourth order

Cited in

(8)

• Tight tail probability bounds for distribution-free decision making
• Distortion risk measure under parametric ambiguity
• Controlling risk and demand ambiguity in newsvendor models
• Heterogeneity, asymmetry and applicability of behavioral newsvendor models
• MAD dispersion measure makes extremal queue analysis simple
• Protecting the data-driven newsvendor against rare events: a correction-term approach
• Advance selling under uncertain supply and demand: a robust newsvendor perspective
• Building up cyber resilience by better grasping cyber risk via a new algorithm for modelling heavy-tailed data

Describes a project that uses

Uses Software

• SDPT3

This page was built for publication: On the heavy-tail behavior of the distributionally robust newsvendor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5031607)