Conditions for the discovery of solution horizons
From MaRDI portal
Publication:2368078
DOI10.1007/BF01581244zbMath0780.90107MaRDI QIDQ2368078
Robert L. Smith, James C. Bean
Publication date: 22 August 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
dynamic programming; shortest path; undiscounted Markov decision processes; optimal search; discrete infinite horizon optimization; infinite directed network
Related Items
Effective information horizon length in measuring off-line performance of stochastic dynamic systems, Effective information for offline stochastic feedback and optimal control of dynamic systems, Infinite horizon programs; convergence of approximate solutions, A simplex algorithm for minimum-cost network-flow problems in infinite networks
Cites Work
- Unnamed Item
- Unnamed Item
- Imbedding posets in the integers
- Conditions for the existence of decision horizons for discounted problems in a stochastic environment: A note
- Non-negative matrices and Markov chains. 2nd ed
- On the open-loop solution of linear stochastic optimal control problems
- Conditions for the Existence of Planning Horizons
- Minimal forecast horizon procedures for dynamic lot size models
- Optimal Capacity Expansion Over an Infinite Horizon
- Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model
- Aggregation in Dynamic Programming
- A New Optimality Criterion for Nonhomogeneous Markov Decision Processes
- Concepts of Forecast and Decision Horizons: Applications to Dynamic Stochastic Optimization Problems
- Approximating an Infinite Stage Search Problem with a Finite Horizon Model
- Turnpike Theory
- Technical Note—Identifying Forecast Horizons in Nonhomogeneous Markov Decision Processes
- A Finite Renewal Algorithm for the Knapsack and Turnpike Models
- Arbitrary State Markovian Decision Processes
