A binary solution method for the multi-product newsboy problem with budget constraint
A binary solution method for the multi-product newsboy problem with budget constraint
复制标题
DOI：
10.1016/j.ijpe.2008.10.003
复制
发表时间：
2009
影响因子：
12
通讯作者：
Bin Zhang;Xiaoyan Xu;Zhongsheng Hua
中科院分区：
文献类型：
--
作者：
Bin Zhang;Xiaoyan Xu;Zhongsheng Hua
具有预算约束的多产品报童问题（MPNP）是一个经典的库存控制/管理问题。然而，当前文献中一般需求分布下 MPNP 的求解方法有限。在本文中，通过分析具有预算约束的 MPNP 最优解的性质，我们开发了一种约束 MPNP 的求解算法。所提出的算法本质上是二元的，并且适用于一般类型的需求分布函数，离散的和连续的。对于连续需求分布函数，我们的方法可以获得具有 o(n) 阶多项式计算复杂度的约束 MPNP 的最优或接近最优解。另一方面，对于离散的需求分布函数，它可以有效地提供良好的近似解。数值实验展示了我们方法的性能。
Multi-product newsboy problem (MPNP) with budget constraint is a classical inventory control/management problem. However, solution methods for MPNP under general demand distributions are limited in the current literature. In this paper, by analyzing properties of the optimal solution to the MPNP with a budget constraint, we develop a solution algorithm for the constrained MPNP. The proposed algorithm is binary in nature, and is applicable to general types of demand distribution functions, discrete as well as continuous. For continuous demand distribution function, our approach can obtain the optimal or near optimal solution to the constrained MPNP with polynomial computation complexity of the o(n) order. On the other hand, for discrete demand distribution functions, it can effectively provide good approximate solution. Numerical experiments are presented to show the performance of our method.