Page 1

Displaying 1 – 1 of 1

Showing per page

Warm-start cuts for Generalized Benders Decomposition

Jakub Kůdela, Pavel Popela (2017)

Kybernetika

In this paper, we describe a decomposition algorithm suitable for two-stage convex stochastic programs known as Generalized Benders Decomposition. For this algorithm we propose a new reformulation that incorporates a lower bound cut that serves as a warm-start, decreasing the overall computation time. Additionally, we test the performance of the proposed reformulation on two modifications of the algorithm (bunching and multicut) using numerical examples. The numerical part is programmed in MATLAB...

Currently displaying 1 – 1 of 1

Page 1