Transient policies in discrete dynamic programming: Linear programming including suboptimality tests and additional constraints
From MaRDI portal
Publication:3337979
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
Cites work
- scientific article; zbMATH DE number 3181418 (Why is no real title available?)
- scientific article; zbMATH DE number 3731792 (Why is no real title available?)
- scientific article; zbMATH DE number 3607837 (Why is no real title available?)
- scientific article; zbMATH DE number 3623330 (Why is no real title available?)
- scientific article; zbMATH DE number 3631458 (Why is no real title available?)
- scientific article; zbMATH DE number 3445938 (Why is no real title available?)
- scientific article; zbMATH DE number 3225772 (Why is no real title available?)
- scientific article; zbMATH DE number 3239038 (Why is no real title available?)
- Contraction Mappings in the Theory Underlying Dynamic Programming
- Discrete Dynamic Programming
- Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
- Discrete Dynamic Programming with a Small Interest Rate
- Finite state Markovian decision processes
- Letter to the Editor—A Test for Suboptimal Actions in Markovian Decision Problems
- Linear Programming and Markov Decision Chains
- Normalized Markov Decision Chains I; Sensitive Discount Optimality
- Normalized Markov Decision Chains. II: Optimality of Nonstationary Policies
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)