A Tie-Breaking Rule for Discrete Infinite Horizon Optimization
暂无分享,去创建一个
[1] J. C. Bean,et al. Optimal Capacity Expansion Over an Infinite Horizon , 1985 .
[2] Robert L. Smith,et al. Turnpike Results for Single Location Capacity Expansion , 1979 .
[3] Jean B. Lasserre. Detecting planning horizons in deterministic infinite horizon optimal control , 1986 .
[4] Jeremy F. Shapiro,et al. A Finite Renewal Algorithm for the Knapsack and Turnpike Models , 1967, Oper. Res..
[5] Sarah M. Ryan,et al. Degeneracy in infinite horizon optimization , 1989, Math. Program..
[6] Robert L. Smith,et al. A New Optimality Criterion for Nonhomogeneous Markov Decision Processes , 1987, Oper. Res..
[7] L. McKenzie,et al. Turnpike Theory , 1976 .
[8] D. K. Skilton. Imbedding posets in the integers , 1985 .
[9] Robert L. Smith,et al. Conditions for the discovery of solution horizons , 1993, Math. Program..
[10] Suresh Chand,et al. Minimal forecast horizon procedures for dynamic lot size models , 1986 .
[11] C. Bes,et al. Concepts of Forecast and Decision Horizons: Applications to Dynamic Stochastic Optimization Problems , 1986, Math. Oper. Res..
[12] Bernard Yaged. Economies of Scale, Networks, and Network Cost Elasticity , 1975, IEEE Transactions on Systems, Man, and Cybernetics.
[13] Robert L. Smith,et al. Infinite Horizon Optimization , 1989, Math. Oper. Res..
[14] Robert L. Smith,et al. Conditions for the Existence of Planning Horizons , 1984, Math. Oper. Res..