Paperlane

no. 13 · Wednesday 11 November 2026

Adaptive Multi-Fidelity Benders Decomposition for Security-constrained Transmission Expansion Planning

Jeffrey Christiansen, Andreas T. Ernst and Terrence Mak

math.OC · 33 pp

Abstract

Energy grids worldwide rely on efficient, effective and resilient transmission networks to deliver power from generators to geographically distant destinations. The optimisation problem of designing these networks is made very difficult by the non-linearity and non-convexity of the equations which govern AC power flow. In this paper we propose the Adaptive Multi-Fidelity Benders Decomposition (AMFBD) algorithm, which is capable of solving to global optimality the Security-Constrained Transmission Expansion Planning problems with N-1 redundancy, using the non-convex AC power flow equations. We demonstrate the practical capability of this algorithm by solving security-constrained expansion problems based on the Garver 6-bus problem and the 14-bus IEEE test case. Given the large costs generally associated with energy grids, globally optimal investment decisions that can be found using AMFBD have the potential to provide significant practical benefits over suboptimal solutions produced by approximations or heuristics.

comments
33 pages, 4 figures, submitted to INFORMS Journal on Computing
fields
Optimization and Control
pdf ↗ page arXiv:2611.13559 ↗