Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints
Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints
复制标题
DOI：
10.1016/j.ejor.2011.10.053
复制
发表时间：
2012-04
期刊：
影响因子：
--
通讯作者：
Bin Zhang
中科院分区：
文献类型：
--
作者：
Bin Zhang
研究了一个具有多约束条件的多产品报贩问题。问题中的多个约束条件使其求解更具挑战性。以往的研究试图通过考虑双约束情况或使用近似技术或活动集方法来解决这一问题。文献中求解多约束问题的方法有限或繁琐。本文通过分析多约束多产品报贩问题的结构性质，提出了求解该问题最优解的多层二元解方法。该方法适用于任意连续需求分布和两个以上约束的问题，其计算复杂度为乘积数的多项式。数值结果表明了该方法的有效性。
This paper considers a multi-product newsvendor problem with multiple constraints. Multiple constraints in the problem make it more challenging to solve. Previous research has attempted to solve the problem by considering two-constraint case or/and using approximation techniques or active sets methods. The solution methods in literature for solving multi-constraint problem are limited or cumbersome. In this paper, by analyzing structural properties of the multi-constraint multi-product newsvendor problem, we develop a multi-tier binary solution method for yielding the optimal solution to the problem. The proposed method is applicable to the problem with any continuous demand distribution and more than two constraints, and its computational complexity is polynomial in the number of products. Numerical results are presented for showing the effectiveness of our method.