Many extensions to the newsboy problem have been solved in the literature. Two of those extensions solve a multi-product newsboy problem with a storage or budget constraint, and a single-product newsboy problem in which multiple discounts are used to sell excess inventory. In this paper, we formulate and solve a multi-product newsboy problem in which multiple discounts are used to sell excess inventory under a storage or budget constraint. We provide an efficient algorithm to solve the new problem and illustrate the results with numerical examples.
机构:
Sun Yat Sen Univ, Lingnan Coll, Guangzhou 510275, Guangdong, Peoples R ChinaSun Yat Sen Univ, Lingnan Coll, Guangzhou 510275, Guangdong, Peoples R China
机构:
Tsinghua Univ, Dept Ind Engn, Beijing, Peoples R ChinaTsinghua Univ, Dept Ind Engn, Beijing, Peoples R China
Liu, Changchun
Xiang, Xi
论文数: 0引用数: 0
h-index: 0
机构:
Tsinghua Univ, Dept Ind Engn, Beijing, Peoples R China
Tsinghua Univ, Logist Engn & Simulat Lab, Grad Sch Shenzhen, Shenzhen, Peoples R China
Dept Ind Engn, Shenzhen Campus, Shenzhen, Peoples R ChinaTsinghua Univ, Dept Ind Engn, Beijing, Peoples R China
Xiang, Xi
Zheng, Li
论文数: 0引用数: 0
h-index: 0
机构:
Tsinghua Univ, Dept Ind Engn, Beijing, Peoples R ChinaTsinghua Univ, Dept Ind Engn, Beijing, Peoples R China
Zheng, Li
Ma, Jing
论文数: 0引用数: 0
h-index: 0
机构:
Tsinghua Univ, Dept Ind Engn, Beijing, Peoples R ChinaTsinghua Univ, Dept Ind Engn, Beijing, Peoples R China