Modeling of Network Constraints in Large-scale Capacity Expansion Optimization of Power Grids
Abstract
Capacity expansion modeling plays a critical role in optimizing the deployment of new generation, storage, and transmission, typically at national and regional levels. To support long-term planning, these models consider a large set of energy technologies and policies, along with decades of weather and demand data. Realistic capacity expansion models thus become high-dimensional optimization problems, with hundreds of millions of variables and constraints, which are challenging to solve. A common strategy to address this complexity is to omit non-linear, non-convex AC optimal power flow (ACOPF) constraints and instead use linearized power balance equations or transport formulations. While these simplifications improve tractability, they limit our understanding of how power flow and the physical properties of power networks impact investment decisions across generation, storage, and transmission infrastructure. This paper addresses this gap by extending the GenX capacity expansion model to incorporate fixed point theorem-based network constraints. These embed ACOPF-based considerations while maintaining the tractability of the planning model, nearly preserving the dimensionality of the transport formulation and incurring only modest runtime increases. This approach is much cheaper than embedding ACOPF directly, making it appropriate for large-scale capacity planning problems. We compare our approach to the original transport-based GenX model as well as a non-linear, non-convex version that incorporates the full ACOPF constraints, for a case study of the ISO New England grid.
Versions
Related
- Time to AC-t: When AC-transmission changes capacity expansion planning
- Admissibility-Preserving Control for Multi-Input Systems with Joint Capacity Constraints
- Capacity Bounds for Optical Interference Channels Subject to Average Power Constraints
- Logarithmic capacity and torsion in planar shape optimization
- A sequential quadratic programming method for optimization with expectation objective functions, deterministic inequality constraints and robust subproblems
BibTeX
@misc{weng2026modeling,
title = {{Modeling of Network Constraints in Large-scale Capacity Expansion Optimization of Power Grids}},
author = {Yu Weng and Lara Booth and Priya L. Donti and Ruaridh Macdonald},
howpublished = {arXiv},
year = {2026},
month = aug,
doi = {10.48550/arxiv.2608.28893},
eprint = {2608.28893},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.28893},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - Modeling of Network Constraints in Large-scale Capacity Expansion Optimization of Power Grids
AU - Yu Weng
AU - Lara Booth
AU - Priya L. Donti
AU - Ruaridh Macdonald
PY - 2026
DA - 2026/08/28
PB - arXiv
DO - 10.48550/arxiv.2608.28893
UR - https://arxiv.org/abs/2608.28893
AB - Capacity expansion modeling plays a critical role in optimizing the deployment of new generation, storage, and transmission, typically at national and regional levels. To support long-term planning, these models consider a large set of energy technologies and policies, along with decades of weather and demand data. Realistic capacity expansion models thus become high-dimensional optimization problems, with hundreds of millions of variables and constraints, which are challenging to solve. A common strategy to address this complexity is to omit non-linear, non-convex AC optimal power flow (ACOPF) constraints and instead use linearized power balance equations or transport formulations. While these simplifications improve tractability, they limit our understanding of how power flow and the physical properties of power networks impact investment decisions across generation, storage, and transmission infrastructure. This paper addresses this gap by extending the GenX capacity expansion model to incorporate fixed point theorem-based network constraints. These embed ACOPF-based considerations while maintaining the tractability of the planning model, nearly preserving the dimensionality of the transport formulation and incurring only modest runtime increases. This approach is much cheaper than embedding ACOPF directly, making it appropriate for large-scale capacity planning problems. We compare our approach to the original transport-based GenX model as well as a non-linear, non-convex version that incorporates the full ACOPF constraints, for a case study of the ISO New England grid.
ER -