Expected Value of Distribution Information for the Newsvendor Problem
Expected Value of Distribution Information for the Newsvendor Problem
复制标题
DOI：
10.1287/opre.1060.0318
复制
发表时间：
2006-11
期刊：
影响因子：
--
通讯作者：
Jinfeng Yue;Bintong Chen;Min-Chiang Wang
中科院分区：
文献类型：
--
作者：
Jinfeng Yue;Bintong Chen;Min-Chiang Wang
本文扩展了以前的工作的分布免费报童问题，只有部分信息的需求分布。更具体地说，分析假设需求分布f属于一类具有平均值μ和标准差σ的概率分布函数（pdf）F。虽然以前的工作已经检查了一个特定的订单量和一个特定的pdf f的分布信息（EVDI）的期望值，本文的目的是计算所有f ∈ F的任何订单量的最大EVDI。此外，提供了一个优化过程，以计算最小化最大EVDI的订单数量。
This paper extends previous work on the distribution-free newsvendor problem, where only partial information about the demand distribution is available. More specifically, the analysis assumes that the demand distribution f belongs to a class of probability distribution functions (pdf) F with mean μ and standard deviation σ. While previous work has examined the expected value of distribution information (EVDI) for a particular order quantity and a particular pdf f, this paper aims at computing the maximum EVDI over all f ∈ F for any order quantity. In addition, an optimization procedure is provided to calculate the order quantity that minimizes the maximum EVDI.