A column-and-constraint generation algorithm for two-stage stochastic programming problems

Denise D. Tönissen, Joachim J. Arts, Zuo-Jun Max Shen

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

This paper presents a column-and-constraint generation algorithm for two-stage stochastic programming problems. A distinctive feature of the algorithm is that it does not assume fixed recourse and as a consequence the values and dimensions of the recourse matrix can be uncertain. The proposed algorithm contains multi-cut (partial) Benders decomposition and the deterministic equivalent model as special cases and can be used to trade-off computational speed and memory requirements. The algorithm outperforms multi-cut (partial) Benders decomposition in computational time and the deterministic equivalent model in memory requirements for a maintenance location routing problem. In addition, for instances with a large number of scenarios, the algorithm outperforms the deterministic equivalent model in both computational time and memory requirements. Furthermore, we present an adaptive relative tolerance for instances for which the solution time of the master problem is the bottleneck and the slave problems can be solved relatively efficiently. The adaptive relative tolerance is large in early iterations and converges to zero for the final iteration(s) of the algorithm. The combination of this relative adaptive tolerance with the proposed algorithm decreases the computational time of our instances even further.
Original languageEnglish
Number of pages18
JournalTOP
DOIs
Publication statusPublished - 16 Feb 2021

Fingerprint Dive into the research topics of 'A column-and-constraint generation algorithm for two-stage stochastic programming problems'. Together they form a unique fingerprint.

Cite this