Pages that link to "Item:Q5301136"
From MaRDI portal
The following pages link to A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes (Q5301136):
Displaying 26 items.
- Robust optimization in countably infinite linear programs (Q276340) (← links)
- Circumventing the Slater conundrum in countably infinite linear programs (Q319852) (← links)
- Policy iteration for robust nonstationary Markov decision processes (Q518127) (← links)
- Computing non-stationary \((s, S)\) policies using mixed integer linear programming (Q724127) (← links)
- On efficiency of linear programming applied to discounted Markovian decision problems (Q1108203) (← links)
- Separable Markovian decision problems. The linear programming method in the multichain case (Q1190392) (← links)
- Linear programming formulation for non-stationary, finite-horizon Markov decision process models (Q1728357) (← links)
- Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space (Q1785223) (← links)
- Inverse optimization in countably infinite linear programs (Q1785341) (← links)
- Singularly perturbed linear programs and Markov decision processes (Q1790182) (← links)
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs (Q2020606) (← links)
- An optimal control approach to day-to-day congestion pricing for stochastic transportation networks (Q2177822) (← links)
- Constrained Markov decision processes with uncertain costs (Q2670508) (← links)
- Decomposable Markov Decision Processes: A Fluid Optimization Approach (Q2957475) (← links)
- A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems (Q3174805) (← links)
- The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization (Q3465240) (← links)
- A Linearly Relaxed Approximate Linear Program for Markov Decision Processes (Q4567182) (← links)
- Survey of linear programming for standard and nonstandard Markovian control problems. Part II: Applications (Q4698111) (← links)
- A Simplex Method for Countably Infinite Linear Programs (Q5020851) (← links)
- A linear programming based approach for composite-action Markov decision processes (Q5214327) (← links)
- Duality in Countably Infinite Monotropic Programs (Q5359500) (← links)
- Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces (Q5853565) (← links)
- The policy graph decomposition of multistage stochastic programming problems (Q6092646) (← 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)
- Zero-sum non-stationary stochastic games with the long-run average criterion (Q6622700) (← links)
