A multi-product constrained newsboy problem with progressive multiple discounts

被引:57
作者
Khouja, M [1 ]
Mehrez, A [1 ]
机构
[1] KENT STATE UNIV,COLL BUSINESS ADM,GRAD SCH MANAGEMENT,KENT,OH 44242
关键词
D O I
10.1016/0360-8352(95)00025-9
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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.
引用
收藏
页码:95 / 101
页数:7
相关论文
共 21 条
[2]  
Bazaraa MokhtarS., 1979, Nonlinear Programming: Theory and Algorithms
[3]  
GUILLERMO G, 1993, J OPERL RES SOC, V44, P825
[4]  
Hadley G., 1963, ANAL INVENTORY SYSTE
[5]  
Hax A., 1984, PRODUCTION INVENTORY
[6]  
HOROWITZ E, 1978, F COMPUTER ALGORITHM
[7]  
Ismail B. E., 1979, Decision Sciences, V10, P205, DOI 10.1111/j.1540-5915.1979.tb00019.x
[8]   SINGLE-PERIOD INVENTORY MODELS WITH DEMAND UNCERTAINTY AND QUANTITY DISCOUNTS - BEHAVIORAL-IMPLICATIONS AND A NEW SOLUTION PROCEDURE [J].
JUCKER, JV ;
ROSENBLATT, MJ .
NAVAL RESEARCH LOGISTICS, 1985, 32 (04) :537-550
[9]  
KABAK I, 1972, AIIE T, V4, P154
[10]  
KHOUJA M, 1994, NOTE NEWSBOY PROBLEM