Benders decomposition: sequential solving of several different submodels
Benders decomposition is a method for solving large MIP problems. The model implementation shows the following features:
Further explanation of this example: Xpress Whitepaper 'Multiple models and parallel solving with Mosel', Section 'Benders decomposition: working with several different submodels'.
By clicking on a file name, a preview is opened at the bottom of this page.
! Benders example problem from: T.C. Hu. Integer programming and network flows A: [1 4 2] B: [ 3 2 -1 1 1 -1] C:  D: [2 2] b: [5 7 4]
|© Copyright 2021 Fair Isaac Corporation.|