A SIMPLE PROOF FOR OPTIMALITY OF (S, S) POLICIES IN INFINITE-HORIZON INVENTORY SYSTEMS

被引:74
作者
ZHENG, YS
机构
关键词
DISCOUNTED COST; AVERAGE COST; UNBOUNDED ONE-STEP COST;
D O I
10.2307/3214683
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
The classical proofs for the existence of a stationary (s, S) inventory policy that minimizes the total discounted or average cost over an infinite horizon are lengthy because they depend heavily on the optimality results for corresponding finite-horizon models. This note presents a simpler alternative. Since optimal stationary (s, S) policies are relatively simple to characterize, it is easy to construct a solution to the optimality equation which is satisfied by an (s, S) policy or an equivalent variant thereof. For the discounted model, the proof characterizes an (s, S) policy that is optimal for all initial inventory positions. This policy can be generated by a simple existing algorithm. For the average-cost model, the optimality proof is completed with some additional arguments, which are simple but novel, to overcome the normal difficulties encountered in models with unbounded one-step expected costs.
引用
收藏
页码:802 / 810
页数:9
相关论文
共 13 条
[2]   AN EFFICIENT ALGORITHM FOR COMPUTING OPTIMAL (S,S) POLICIES [J].
FEDERGRUEN, A ;
ZIPKIN, P .
OPERATIONS RESEARCH, 1984, 32 (06) :1268-1285
[3]  
Howard RonaldA., 1960, DYNAMIC PROGRAMMING
[4]  
Iglehart D., 1963, MULTISTAGE INVENTORY
[5]   OPTIMALITY OF (S, S) POLICIES IN THE INFINITE HORIZON DYNAMIC INVENTORY PROBLEM [J].
IGLEHART, DL .
MANAGEMENT SCIENCE, 1963, 9 (02) :259-267
[6]   ON (S, S) POLICIES [J].
JOHNSON, EL .
MANAGEMENT SCIENCE, 1968, 15 (01) :80-101
[7]  
JUENLE C, 1977, MATH OPERATIONSFORSC, V8, P549
[8]  
Ross S.M., 2014, INTRO STOCHASTIC DYN
[9]  
ROSS SM, 1970, APPLIED PROBABILITY
[10]  
SCARF H, 1990, MATH METHODS SOCIAL