Simplex algorithm for countable-state discounted Markov decision processes
From MaRDI portal
Recommendations
- A simplex method for countably infinite linear programs
- A linear programming approach to nonstationary infinite-horizon Markov decision processes
- Linear programming formulation of MDPs in countable state space: The multichain case
- A shadow simplex method for infinite linear programs
- Revised simplex algorithm for finite Markov decision processes
Cited in
(14)- Revised simplex algorithm for finite Markov decision processes
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
- Robust optimization in countably infinite linear programs
- A shadow simplex method for infinite linear programs
- A simplex method for uncapacitated pure-supply infinite network flow problems
- New approximate dynamic programming algorithms for large-scale undiscounted Markov decision processes and their application to optimize a production and distribution system
- A simplex method for countably infinite linear programs
- Policy iteration for robust nonstationary Markov decision processes
- A linear programming approach to nonstationary infinite-horizon Markov decision processes
- Algorithms for Countable State Markov Decision Models with an Absorbing Set
- Duality in Countably Infinite Monotropic Programs
- Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes
- Duality in convex minimum cost flow problems on infinite networks and hypernetworks
- A primal-dual policy iteration algorithm for constrained Markov decision processes
This page was built for publication: Simplex algorithm for countable-state discounted Markov decision processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5360841)
