Transient policies in discrete dynamic programming: Linear programming including suboptimality tests and additional constraints
DOI10.1007/BF02591798zbMATH Open0546.90101MaRDI QIDQ3337979FDOQ3337979
Authors: Arie Hordijk, Lodewijk Kallenberg
Publication date: 1984
Published in: Mathematical Programming (Search for Journal in Brave)
Recommendations
- Constrained Undiscounted Stochastic Dynamic Programming
- scientific article; zbMATH DE number 3885681
- Constrained Discounted Dynamic Programming
- Survey of linear programming for standard and nonstandard Markovian control problems. Part I: Theory
- Linear programming and constrained average optimality for general continuous-time Markov decision processes in history-dependent policies
additional linear constraintsgeneralized finite Markov decision modelsuboptimality criteriatransient dynamic programmingtransient policies
Linear programming (90C05) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite state Markovian decision processes
- Discrete Dynamic Programming
- Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
- Contraction Mappings in the Theory Underlying Dynamic Programming
- Title not available (Why is that?)
- Linear Programming and Markov Decision Chains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Letter to the Editor—A Test for Suboptimal Actions in Markovian Decision Problems
- Normalized Markov Decision Chains. II: Optimality of Nonstationary Policies
- Title not available (Why is that?)
- Discrete Dynamic Programming with a Small Interest Rate
- Title not available (Why is that?)
- Title not available (Why is that?)
- Normalized Markov Decision Chains I; Sensitive Discount Optimality
Cited In (4)
- Maximum-stopping-value policies in finite Markov population decision chains
- On the reduction of total-cost and average-cost MDPs to discounted mdps
- Survey of linear programming for standard and nonstandard Markovian control problems. Part I: Theory
- Sensitivity analysis in discounted Markovian decision problems
This page was built for publication: Transient policies in discrete dynamic programming: Linear programming including suboptimality tests and additional constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337979)