With the increasing complexity of power systems, faster methods for power system reliability analysis are needed. We propose a novel methodology to solve the security constrained optimal power flow (SCOPF) problem that reduces the computational time by using the Sherman-Morrison-Woodbury identity and Benders decomposition. The case study suggests that in a 500 node system, the run time is reduced by 83.5% while ensuring a reliable operation of the system considering short- and long-term post-contingency limits and reducing the operational costs, compared to a preventive `N-1' strategy.
@article{arxiv.2305.01395,
title = {A Novel Approach for Solving Security Constrained Optimal Power Flow Using the Inverse Matrix Modification Lemma and Benders Decomposition},
author = {Matias Vistnes and Vijay Venu Vadlamudi and Sigurd Hofsmo Jakobsen and Oddbjørn Gjerde},
journal= {arXiv preprint arXiv:2305.01395},
year = {2023}
}