A simple proof for optimality of (s, S) policies in infinite-horizon inventory systems
暂无分享,去创建一个
[1] H. Scarf. THE OPTIMALITY OF (S,S) POLICIES IN THE DYNAMIC INVENTORY PROBLEM , 1959 .
[2] Ronald A. Howard,et al. Dynamic Programming and Markov Processes , 1960 .
[3] D. Iglehart. Optimality of (s, S) Policies in the Infinite Horizon Dynamic Inventory Problem , 1963 .
[4] A. F. Veinott,et al. Computing Optimal (s, S) Inventory Policies , 1965 .
[5] Jr. Arthur F. Veinott. On the Opimality of $( {s,S} )$ Inventory Policies: New Conditions and a New Proof , 1966 .
[6] Ellis L. Johnson. On (s, S) Policies , 1968 .
[7] Colin E. Bell. Improved Algorithms for Inventory and Replacement-Stocking Problems , 1970 .
[8] Christine Küenle,et al. Durchschnittsoptimale strategien in Markovschen entscheidungsmodellea bei unbeschränkten kosten , 1977 .
[9] Dimitri P. Bertsekas,et al. Dynamic Programming and Stochastic Control , 1977, IEEE Transactions on Systems, Man, and Cybernetics.
[10] Awi Federgruen,et al. An Efficient Algorithm for Computing Optimal (s, S) Policies , 1984, Oper. Res..
[11] Awi Federgruen,et al. Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy , 1991, Oper. Res..