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

• Denise D. Tönissen ^[1] ; Joachim J. Arts ^[2] ; Zuo-Jun Max Shen ^[3]
  1. [1] VU University Amsterdam

     VU University Amsterdam

     Países Bajos

     
  2. [2] University of Luxembourg

     University of Luxembourg

     Luxemburgo

     
  3. [3] University of California System

     University of California System

     Estados Unidos

     

  Mostrar afiliaciones +
• Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 29, Nº. 3, 2021, págs. 781-798
• Idioma: inglés
• DOI: 10.1007/s11750-021-00593-2
• Enlaces
  • Texto completo
• Resumen

  • 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.