Single cut and multicut stochastic dual dynamic programming with cut selection for multistage stochastic linear programs: convergence proof and numerical experiments

Michelle Bandarra () and Vincent Guigues ()
Additional contact information
Michelle Bandarra: FGV
Vincent Guigues: FGV

Computational Management Science, 2021, vol. 18, issue 2, No 1, 125-148

Abstract: Abstract We introduce a variant of Multicut Decomposition Algorithms, called CuSMuDA (Cut Selection for Multicut Decomposition Algorithms), for solving multistage stochastic linear programs that incorporates a class of cut selection strategies to choose the most relevant cuts of the approximate recourse functions. This class contains Level 1 (Philpott et al. in J Comput Appl Math 290:196–208, 2015) and Limited Memory Level 1 (Guigues in Eur J Oper Res 258:47–57, 2017) cut selection strategies, initially introduced for respectively Stochastic Dual Dynamic Programming and Dual Dynamic Programming. We prove the almost sure convergence of the method in a finite number of iterations and obtain as a by-product the almost sure convergence in a finite number of iterations of Stochastic Dual Dynamic Programming combined with our class of cut selection strategies. We compare the performance of Multicut Decomposition Algorithms, Stochastic Dual Dynamic Programming, and their variants with cut selection (using Level 1 and Limited Memory Level 1) on several instances of a portfolio problem. On these experiments, in general, Stochastic Dual Dynamic Programming is quicker (i.e., satisfies the stopping criterion quicker) than Multicut Decomposition Algorithms and cut selection allows us to decrease the computational bulk with Limited Memory Level 1 being more efficient (sometimes much more) than Level 1.

Keywords: Stochastic programming; Stochastic dual dynamic programming; Multicut decomposition algorithm; Portfolio selection; 90C15; 91B30 (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10287-021-00387-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:comgts:v:18:y:2021:i:2:d:10.1007_s10287-021-00387-8

Ordering information: This journal article can be ordered from
http://www.springer. ... ch/journal/10287/PS2

DOI: 10.1007/s10287-021-00387-8

Access Statistics for this article

Computational Management Science is currently edited by Ruediger Schultz

More articles in Computational Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().