Pages that link to "Item:Q5360841"
From MaRDI portal
The following pages link to Simplex Algorithm for Countable-State Discounted Markov Decision Processes (Q5360841):
Displaying 9 items.
- Robust optimization in countably infinite linear programs (Q276340) (← links)
- Policy iteration for robust nonstationary Markov decision processes (Q518127) (← links)
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs (Q2020606) (← links)
- A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems (Q3174805) (← links)
- A Simplex Method for Countably Infinite Linear Programs (Q5020851) (← links)
- Algorithms for Countable State Markov Decision Models with an Absorbing Set (Q5317111) (← links)
- Duality in Countably Infinite Monotropic Programs (Q5359500) (← links)
- Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes (Q6116235) (← links)
- Duality in convex minimum cost flow problems on infinite networks and hypernetworks (Q6496346) (← links)