Approximate dynamic programming for stochastic linear control problems on compact state spaces
From MaRDI portal
Publication:299794
DOI10.1016/j.ejor.2014.08.003zbMath1338.90448OpenAlexW2028143206MaRDI QIDQ299794
Stefan Woerner, Marco Laumanns, Apostolos Fertis, Rico Zenklusen
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.08.003
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39) Optimal stochastic control (93E20) Markov and semi-Markov decision processes (90C40)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of stochastic dual dynamic programming method
- Continuous selections. I
- Generalized polynomial approximations in Markovian decision processes
- Multi-stage stochastic optimization applied to energy planning
- Numerical aspects of monotone approximations in convex stochastic control problems
- Value iteration in average cost Markov control processes on Borel spaces
- Average cost optimal policies for Markov control processes with Borel state space and unbounded costs
- Multiparametric linear programming with applications to control
- (s, S) Policies for a Dynamic Inventory Model with Stochastic Lead Times
- Now or Later: A Simple Policy for Effective Dual Sourcing in Capacitated Systems
- The Linear Programming Approach to Approximate Dynamic Programming
- Optimal Inventory Under Stochastic Demand with Two Supply Options
- Constrained markov decision processes with compact state and action spaces: the average case
- Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey
- Average Optimality in Dynamic Programming with General State Space
- Average cost Markov control processes with weighted norms: existence of canonical policies
- Relaxing Dynamic Programming
- Approximate Dynamic Programming
- Computing Optimal (s, S) Inventory Policies
- A Dynamic Inventory Model with Stochastic Lead Times
- STOCHASTIC CONCAVE DYNAMIC PROGRAMMING
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
This page was built for publication: Approximate dynamic programming for stochastic linear control problems on compact state spaces