Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
From MaRDI portal
Recommendations
- Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes
- A linear programming approach to nonstationary infinite-horizon Markov decision processes
- Infinite horizon programs; convergence of approximate solutions
- Infinite-horizon deterministic dynamic programming in discrete time: a monotone convergence principle and a penalty method
- Dual dynamic programming with cut selection: convergence proof and numerical experiments
Cites work
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 38300 (Why is no real title available?)
- scientific article; zbMATH DE number 53116 (Why is no real title available?)
- scientific article; zbMATH DE number 1093829 (Why is no real title available?)
- scientific article; zbMATH DE number 1983335 (Why is no real title available?)
- scientific article; zbMATH DE number 837313 (Why is no real title available?)
- scientific article; zbMATH DE number 5685899 (Why is no real title available?)
- A New Optimality Criterion for Nonhomogeneous Markov Decision Processes
- A linear programming approach to nonstationary infinite-horizon Markov decision processes
- A shadow simplex method for infinite linear programs
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- A simplex method for uncapacitated pure-supply infinite network flow problems
- An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces
- Circumventing the Slater conundrum in countably infinite linear programs
- Concepts of Forecast and Decision Horizons: Applications to Dynamic Stochastic Optimization Problems
- Conditions for the Existence of Planning Horizons
- Convergence of selections with applications in optimization
- Decision and Horizon Rules for Stochastic Planning Problems: A Linear Example
- Duality in convex minimum cost flow problems on infinite networks and hypernetworks
- Equipment replacement under technological change
- Existence of Optimal Policies for Semi-Markov Decision Processes Using Duality for Infinite Linear Programming
- Extreme point characterizations for infinite network flow problems
- Finite linear programming approximations of constrained discounted Markov decision processes
- From infinite to finite programs: explicit error bounds with applications to approximate dynamic programming
- Handbook of Markov decision processes. Methods and applications
- Infinite horizon production planning in time-varying systems with convex production and inventory costs
- On the asymptotic optimality of finite approximations to Markov decision processes with Borel spaces
- Optimal Capacity Expansion Over an Infinite Horizon
- Production Planning Over Time and the Nature of the Expectation and Planning Horizon
- Rolling Horizon Procedures in Nonhomogeneous Markov Decision Processes
- Simplex algorithm for countable-state discounted Markov decision processes
- Stochastic approximations of constrained discounted Markov decision processes
Cited in
(1)
This page was built for publication: Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020606)
