MIDAS: a mixed integer dynamic approximation scheme
A number of authors in the literature have looked to extend stochastic dual dynamic programming (SDDP) methods to deal with non-convex stage problems. In this paper, the authors propose a new extension of SDDP called mixed integer dynamic approximation scheme (MIDAS) for solving multistage stochastic dynamic programming problems with nondecreasing Bellman functions. MIDAS uses the same algorithmic framework as SDDP but instead of using cutting planes, MIDAS uses step functions to approximate the value function. The authors describe the MIDAS algorithm for a deterministic multistage optimization problem (MP), and prove its almost-sure convergence. They extend the model MP to include random noise on the state transition function. Also, the authors give two different extensions of the MIDAS of the deterministic setting: Full-tree MIDAS goes over every node at each iteration and sampled MIDAS computes only one pseudo trajectory at each iteration. They analyze the convergence of the two algorithms. Finaly, a simple hydro-electric scheduling example illustrating the algorithm is presented.
- On the convergence of sampling algorithms for solving dynamic stochastic programming
- Fixed-dimensional stochastic dynamic programs: an approximation scheme and an inventory application
- An approximate dynamic programming algorithm for monotone value functions
- An Adaptive Sampling Algorithm for Solving Markov Decision Processes
- Multistage Stochastic Decomposition: A Bridge between Stochastic Programming and Approximate Dynamic Programming
- Analysis of stochastic dual dynamic programming method
- Approximate Dynamic Programming
- Convergence analysis of sampling-based decomposition methods for risk-averse multistage stochastic convex programs
- Convergent cutting-plane and partial-sampling algorithm for multistage stochastic linear programs with recourse
- Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
- Dynamic programming and optimal control. Vol. 1.
- Energy contracts management by stochastic programming techniques
- Long- and Medium-term Operations Planning and Stochastic Modelling in Hydro-dominated Power Systems Based on Stochastic Dual Dynamic Programming
- Multi-stage stochastic optimization applied to energy planning
- On complexity of multistage stochastic programs
- On the convergence of decomposition methods for multistage stochastic convex programs
- On the convergence of stochastic dual dynamic programming and related methods
- Stochastic dual dynamic integer programming
- Stochastic dual dynamic programming applied to nonconvex hydrothermal models
- Stochastic dual dynamic programming with stagewise-dependent objective uncertainty
- The abridged nested decomposition method for multistage stochastic linear programs with relatively complete recourse
- Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization
- Complexity of stochastic dual dynamic programming
- Stochastic Lipschitz dynamic programming
- Optimal crashing of an activity network with disruptions
- On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty
- Stochastic dual dynamic integer programming
- Inexact cuts in stochastic dual dynamic programming applied to multistage stochastic nondifferentiable problems
- Duality and sensitivity analysis of multistage linear stochastic programs
- scientific article; zbMATH DE number 7733446 (Why is no real title available?)
- Stochastic dual dynamic programming and its variants: a review
- An approximate dynamic programming approach for solving aircraft fleet engine maintenance problem: methodology and a case study
- A generalized Benders decomposition approach for the optimal design of a local multi-energy system
- Decomposition algorithms for computational stochastic mixed-integer programming: a survey
This page was built for publication: MIDAS: a mixed integer dynamic approximation scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188240)