nested benders decomposition – Optimization Online

Relay-Hub Network Design for Consolidation Planning Under Demand Variability

Published: 2024/05/22

Branch and Cut Algorithms, Supply Chain Management, Transportation consolidation-based routing, Decomposition-based Branch-and-Cut, integer l-shaped method, nested benders decomposition, Relay Network Design, Sample Average Approximation (SAA), stochastic demand

Problem description: We study the problem of designing large-scale resilient relay logistics hub networks. We propose a model of Capacitated Relay Network Design under Stochastic Demand and Consolidation-Based Routing (CRND-SDCR), which aims to improve a network’s efficiency and resilience against commodity demand variability through integrating tactical decisions. Methodology: We formulate CRND-SDCR as a two-stage stochastic … Read more

Stochastic dual dynamic programming and its variants – a review

Published: 2021/01/19, Updated: 2024/10/16

Christian Füllner

Steffen Rebennack

Stochastic Programming global optimization, large-scale optimization, linear programming, multistage stochastic programming, nested benders decomposition, nonconvex optimization, sampling-based optimization, stochastic dual dynamic programming

We provide a tutorial-type review on stochastic dual dynamic programming (SDDP), as one of the state-of-the-art solution methods for large-scale multistage stochastic programs. Since introduced about 30 years ago for solving large-scale multistage stochastic linear programming problems in energy planning, SDDP has been applied to practical problems from several fields and is enriched by various … Read more