Deterministic discrete dynamic programming with discount factor greater than one: Some further results and algorithms
From MaRDI portal
Publication:4047402
DOI10.1007/BF01949716zbMATH Open0294.90064OpenAlexW2078163775MaRDI QIDQ4047402FDOQ4047402
Publication date: 1974
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01949716
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10) Hamilton-Jacobi theories (49L99)
Cites Work
- Finite state Markovian decision processes
- Discrete Dynamic Programming
- Objectives, Constraints, and Outcomes in Optimal Growth Models
- Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix
- New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
- Deterministic Discrete Dynamic Programming with Discount Factor Greater than One: Structure of Optimal Policies
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Deterministic discrete dynamic programming with discount factor greater than one: Some further results and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4047402)
