Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
type: Item
instance of: scholarly article
title: Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
zbMATH Open document ID: 1465.90115
author: Christopher Thomas Ryan
author: Robert L. Smith
published in: Mathematical Programming. Series A. Series B
publication date: 2021-04-23T00:00:00Z
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7337510
zbMATH Keywords: dual-ascent method
zbMATH Keywords: primal-dual algorithm
zbMATH Keywords: dual-based methods
zbMATH Keywords: infinite network flow problems
MaRDI profile type: Publication
full work available at URL: s10107-020-01478-1
OpenAlex ID: W3007764701
cites work: Rolling Horizon Procedures in Nonhomogeneous Markov Decision Processes
cites work: Q3770273
cites work: Conditions for the Existence of Planning Horizons
cites work: Optimal Capacity Expansion Over an Infinite Horizon
cites work: Equipment replacement under technological change
cites work: Q4003376
cites work: Concepts of Forecast and Decision Horizons: Applications to Dynamic Stochastic Optimization Problems
cites work: Decision and Horizon Rules for Stochastic Planning Problems: A Linear Example
cites work: Q4427313
cites work: Finite linear programming approximations of constrained discounted Markov decision processes
cites work: Stochastic approximations of constrained discounted Markov decision processes
cites work: From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming
cites work: Handbook of Markov decision processes. Methods and applications
cites work: Circumventing the Slater conundrum in countably infinite linear programs
cites work: A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes
cites work: A Shadow Simplex Method for Infinite Linear Programs
cites work: Q4863593
cites work: A New Optimality Criterion for Nonhomogeneous Markov Decision Processes
cites work: Existence of Optimal Policies for Semi-Markov Decision Processes Using Duality for Infinite Linear Programming
cites work: An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces
cites work: Simplex Algorithm for Countable-State Discounted Markov Decision Processes
cites work: Production Planning Over Time and the Nature of the Expectation and Planning Horizon
cites work: Q5305630
cites work: Extreme point characterizations for infinite network flow problems
cites work: Q4367948
cites work: A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems
cites work: Q3990571
cites work: On the Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces
cites work: Convergence of selections with applications in optimization
cites work: A simplex algorithm for minimum-cost network-flow problems in infinite networks
cites work: Infinite horizon production planning in time-varying systems with convex production and inventory costs
cites work: Duality in convex minimum cost flow problems on infinite networks and hypernetworks
DOI: 10.1007/S10107-020-01478-1
description: scientific article; zbMATH DE number 7337510