Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs

DOI10.1007/S10107-020-01478-1zbMath1465.90115OpenAlexW3007764701MaRDI QIDQ2020606

Christopher Thomas Ryan, Robert L. Smith

Publication date: 23 April 2021

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-020-01478-1

zbMATH Keywords

primal-dual algorithminfinite network flow problemsdual-based methodsdual-ascent method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Dynamic programming (90C39)

Related Items (1)

Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Circumventing the Slater conundrum in countably infinite linear programs
• Convergence of selections with applications in optimization
• Stochastic approximations of constrained discounted Markov decision processes
• Infinite Horizon Production Planning in Time-Varying Systems with Convex Production and Inventory Costs
• Finite Linear Programming Approximations of Constrained Discounted Markov Decision Processes
• A Shadow Simplex Method for Infinite Linear Programs
• A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems
• Conditions for the Existence of Planning Horizons
• Extreme point characterizations for infinite network flow problems
• Existence of Optimal Policies for Semi-Markov Decision Processes Using Duality for Infinite Linear Programming
• A simplex algorithm for minimum-cost network-flow problems in infinite networks
• Optimal Capacity Expansion Over an Infinite Horizon
• A New Optimality Criterion for Nonhomogeneous Markov Decision Processes
• Concepts of Forecast and Decision Horizons: Applications to Dynamic Stochastic Optimization Problems
• Rolling Horizon Procedures in Nonhomogeneous Markov Decision Processes
• Equipment replacement under technological change
• From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming
• On the Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces
• A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes
• Simplex Algorithm for Countable-State Discounted Markov Decision Processes
• An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces
• Decision and Horizon Rules for Stochastic Planning Problems: A Linear Example
• Production Planning Over Time and the Nature of the Expectation and Planning Horizon
• Handbook of Markov decision processes. Methods and applications
• Duality in convex minimum cost flow problems on infinite networks and hypernetworks

This page was built for publication: Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs