Domain reduction for Benders decomposition based global optimization

• Systematic integration of domain reduction in GBD and NGBD.
• Novel reduced-space bound contraction problems for GBD and NGBD.
• Customized range reduction calculations for primal subproblems in NGBD.
• Case study results showing the significant improvement of GBD and NGBD with domain reduction.

While domain reduction has been successfully applied in branch-and-bound based global optimization over the last two decades, it has not been systematically studied for decomposition based global optimization, which is usually more efficient for problems with decomposable structures. This paper discusses integration of domain reduction in Benders decomposition based global optimization, specifically, generalized Benders decomposition (GBD) and nonconvex generalized Benders decomposition (NGBD). Revised GBD and NGBD frameworks are proposed to incorporate bound contraction operations or/and range reduction calculations, which can reduce the variable bounds and therefore improve the convergence rate and expedite the solution of nonconvex subproblems. Novel customized bound contraction problems are proposed for GBD and NGBD, and they are easier to solve than the classical bound contraction problems because they are defined on reduced variable spaces. The benefits of the proposed methods are demonstrated through a gas production operation problem and a power distribution system design problem.