IMPULSE CONTROL WITH DISCONTINUOUS SETUP COSTS: DISCOUNTED COST CRITERION

被引:4
|
作者
Xu, Fen [1 ,2 ]
Yao, Dacheng [3 ]
Zhang, Hanqin [4 ]
机构
[1] Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
[2] Univ Chinese Acad Sci, Sch Math Sci, Beijing 100049, Peoples R China
[3] Chinese Acad Sci, Acad Math & Syst Sci, MADIS, CEMS, Beijing 100190, Peoples R China
[4] Natl Univ Singapore, Dept Analyt & Operat, Singapore 119245, Singapore
基金
中国国家自然科学基金;
关键词
inventory; impulse control; quantity-dependent setup cost; (s; S); policy; S(x) : x <= s) policy; CONTINUOUS INVENTORY MODELS; DIFFUSION DEMANDS; COMPOUND POISSON; POLICY; OPTIMALITY; SYSTEMS;
D O I
10.1137/19M1299244
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper studies a continuous-review backlogged inventory model considered by [K. L. Helmes, R. H. Stockbridge, and C. Zhu, SIAM J. Control. Optim., 53 (2015), pp. 2100-2140] but with discontinuous quantity-dependent setup cost for each order. In particular, the setup cost is characterized by a two-step function and a higher cost would be charged once the order quantity exceeds a threshold Q. Unlike the optimality of the (s, S)-type policy obtained by Helmes, Stockbridge, and Zhu for continuous setup cost with the discounted cost criterion, we find that, in our model, although some (s, S)-type policy is indeed optimal in some cases, the (s, S)-type policy cannot always be optimal. In particular, we show that there exist cases in which an (s, S) policy is optimal for some initial levels but it is strictly worse than a generalized (s, {S(x) : x <= s}) policy for the other initial levels. Under (s, {S(x) : x <= s}) policy, it orders nothing for x > s and orders up to level S(x) for x <= s, where S(x) is a nonconstant function of x. We further prove the optimality of such (s, {S(x) : x <= s}) policy in a large subset of admissible policies for those initial levels. Moreover, the optimality is obtained through establishing a more general lower bound theorem which will also be applicable in solving some other optimization problems by the lower bound approach.
引用
收藏
页码:267 / 295
页数:29
相关论文
共 50 条