pith. sign in

arxiv: 1312.3158 · v1 · pith:DXAHBFS3new · submitted 2013-12-11 · 🧮 math.OC · cs.DS

Benders, Nested Benders and Stochastic Programming: An Intuitive Introduction

classification 🧮 math.OC cs.DS
keywords bendersprogrammingstochasticnestedproblemsaimsalgorithmarticle
0
0 comments X
read the original abstract

This article aims to explain the Nested Benders algorithm for the solution of large-scale stochastic programming problems in a way that is intelligible to someone coming to it for the first time. In doing so it gives an explanation of Benders decomposition and of its application to two-stage stochastic programming problems (also known in this context as the L-shaped method), then extends this to multi-stage problems as the Nested Benders algorithm. The article is aimed at readers with some knowledge of linear and possibly stochastic programming but aims to develop most concepts from simple principles in an understandable way. The focus is on intuitive understanding rather than rigorous proofs.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Combined Stochastic and Robust Optimization for Electric Autonomous Mobility-on-Demand with Nested Benders Decomposition

    eess.SY 2025-08 unverdicted novelty 5.0

    A stochastic-robust MPC framework with Nested Benders Decomposition for EAMoD reduces median waiting times by up to 36% and electricity costs by over 35% versus baselines in city simulations.