Two methods of pruning Benders' cuts and their application to the management of a gas portfolio

In this article, we describe a gas portfolio management problem, which is solved with the SDDP (Stochastic Dual Dynamic Programming) algorithm. We present some improvements of this algorithm and focus on methods of pruning Benders' cuts, that is to say, methods of picking out the most relevant cuts among those which have been computed. Our territory algorithm allows a quick selection and a great reduction of the number of cuts. Our second method only deletes cuts which do not contribute to the approximation of the value function, thanks to a test of usefulness. Numerical results are presented.

Data and Resources

Additional Info

Field Value
Source https://inria.hal.science/hal-00753578
Author Pfeiffer, Laurent, Apparigliato, Romain, Auchapt, Sophie
Maintainer CCSD
Last Updated October 29, 2026, 17:44 (UTC)
Created October 29, 2026, 17:44 (UTC)
Identifier Report N°: RR-8133
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Centre de Mathématiques Appliquées de l'Ecole polytechnique (CMAP) ; Institut National de Recherche en Informatique et en Automatique (Inria)-École polytechnique (X) ; Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)
creator Pfeiffer, Laurent
date 2012-11-19T00:00:00
harvest_object_id a22269a8-be9c-4221-8c9d-68bfa7cd424e
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-09-04T00:00:00
set_spec type:REPORT