Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes
Published Online:1 Feb 2007https://doi.org/10.1287/moor.1060.0224
References
- Rolling horizon procedures in nonhomogeneous Markov decision processes. Oper. Res. (1994) 40:S183–S194Link, Google Scholar
- On submodular functions of dynamic programming. (1995) 1–23Technical Report 2658, INRIA, FranceGoogle Scholar
- Conditions for the existence of planning horizons. Math. Oper. Res. (1984) 9:391–401Link, Google Scholar
- Conditions for the discovery of planning horizons. Math. Programming (1993) 59:215–229Crossref, Google Scholar
- Aggregation in dynamic programming. Oper. Res. (1987) 35:215–220Link, Google Scholar
- Denumerable state nonhomogeneous Markov decision processes. J. Math. Anal. Appl. (1990) 153:64–77Crossref, Google Scholar
- An online procedure in discounted infinite-horizon stochastic optimal control. J. Optim. Theory Appl. (1986) 50:61–67Crossref, Google Scholar
- Concepts of forecast and decision horizons: Applications to dynamic stochastic optimization problems. Math. Oper. Res. (1988) 13:295–310Link, Google Scholar
- Conditions for the existence of decision horizons for discounted problems in stochastic environment: A note. Oper. Res. Lett. (1985) 4:61–65Crossref, Google Scholar
- Forecast, solution and rolling horizons in operations management problems: A classified bibliography. Manufacturing Service Oper. Management (2002) 4:25–43Link, Google Scholar
- Infinite horizon production scheduling in time-varying systems under stochastic demand. Oper. Res. (2004) 52:105–115Link, Google Scholar
- Solution and forecast horizons for infinite horizon nonhomogeneous Markov desion processes. (2005) 1–32Technical Report 05-10, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MIGoogle Scholar
- Conditions for the uniqueness of optimal policies of discounted Markov decision processes. Math. Methods Oper. Res. (2004) 60:415–436Crossref, Google Scholar
- Solving nonstationary infinite horizon dynamic optimization problems. J. Math. Anal. Appl. (2000) 244:304–317Crossref, Google Scholar
- Adaptive Markov Control Processes (1989) (Springer, New York) Crossref, Google Scholar
- A forecast horizon and a stopping rule for general Markov decision processes. J. Math. Anal. Appl. (1988) 132:388–400Crossref, Google Scholar
- Identifying forecast horizons in nonhomogeneous Markov decision processes. Oper. Res. (1989) 37:339–343Link, Google Scholar
- A new optimality criterion for nonhomogeneous Markov decision processes. Oper. Res. (1987) 85:875–883Link, Google Scholar
- Rolling planning horizons: Error bounds for dynamic lot size model. Math. Oper. Res. (1986) 11:423–432Link, Google Scholar
- Introduction to Stochastic Dynamic Programming (1983) (Academic Press, New York) Google Scholar
- Degeneracy in infinite horizon optimization. Math. Programming (1989) 43:305–316Crossref, Google Scholar
- A tie-breaking algorithm for discrete infinite horizon optimization. Oper. Res. (1992) 40:S117–S126Link, Google Scholar
- Finite dimensional approximation in infinite dimensional mathematical programming. Math. Programming (1992) 54:307–333Crossref, Google Scholar
- Infinite horizon production planning in time varying systems with convex production and inventory costs. Management Sci. (1998) 44:1313–1320Link, Google Scholar
- Supermodularity and Complementarity (1998) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar

