Pages that link to "Item:Q4304583"
From MaRDI portal
The following pages link to Linear programming formulation of MDPs in countable state space: The multichain case (Q4304583):
Displaying 12 items.
- Circumventing the Slater conundrum in countably infinite linear programs (Q319852) (← links)
- LP based upper and lower bounds for Cesàro and Abel limits of the optimal values in problems of control of stochastic discrete time systems (Q831480) (← links)
- Linear programming formulations of Markov decision processes (Q1075957) (← links)
- Average optimal stationary policies and linear programming in countable space Markov decision processes (Q1329326) (← links)
- Discounted cost Markov decision processes on Borel spaces: The linear programming formulation (Q1329330) (← links)
- Reformulation of the linear program for completely ergodic MDPs with average cost criteria (Q1676496) (← links)
- Semi-infinite Markov decision processes (Q1974026) (← links)
- On structural properties of optimal average cost functions in Markov decision processes with Borel spaces and universally measurable policies (Q2069795) (← links)
- The LP approach in average reward MDPs with multiple cost constraints: The countable state case (Q4354089) (← links)
- Constrained markov decision processes with compact state and action spaces: the average case (Q4512756) (← links)
- On Linear Programming for Constrained and Unconstrained Average-Cost Markov Decision Processes with Countable Action Spaces and Strictly Unbounded Costs (Q5085149) (← links)
- Duality in Markov Decision Problems with Countable Action and State Spaces (Q5605602) (← links)
