Adaptive Partition-based SDDP Algorithms for Multistage Stochastic Linear Programming

08/29/2019
by   Murwan Siddig, et al.
0

In this paper, we extend the adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse to the multistage stochastic programming setting. The proposed algorithms integrate the adaptive partition-based strategy with a popular approach for solving multistage stochastic programs, the stochastic dual dynamic programming, via different tree-traversal strategies in order to enhance its computational efficiency. Our numerical experiments on a hydro-thermal power generation planning problem show the effectiveness of the proposed algorithms.

READ FULL TEXT

page 10

page 13

page 15

research
09/20/2022

jsdp: a Java Stochastic Dynamic Programming Library

Stochastic Programming is a framework for modelling and solving problems...
research
12/05/2018

A Linear Programming Based Approach to the Steiner Tree Problem with a Fixed Number of Terminals

We present a set of integer programs (IPs) for the Steiner tree problem ...
research
02/26/2019

Approximate Dynamic Programming with Neural Networks in Linear Discrete Action Spaces

Real-world problems of operations research are typically high-dimensiona...
research
12/01/2021

Neural Stochastic Dual Dynamic Programming

Stochastic dual dynamic programming (SDDP) is a state-of-the-art method ...
research
09/18/2022

Online Regenerative Learning

We study a type of Online Linear Programming (OLP) problem that maximize...
research
01/10/2013

A Clustering Approach to Solving Large Stochastic Matching Problems

In this work we focus on efficient heuristics for solving a class of sto...
research
06/25/2021

Optimal Checkpointing for Adjoint Multistage Time-Stepping Schemes

We consider checkpointing strategies that minimize the number of recompu...

Please sign up or login with your details

Forgot password? Click here to reset