A Novel Approach for Solving Security Constrained Optimal Power Flow Using the Inverse Matrix Modification Lemma and Benders Decomposition

2023/05/02 by Matias Vistnes, Vistnes, Matias, Vijay Venu Vadlamudi +5
Engineering · #FOS: Mathematics #Optimal Power Flow Distribution #Optimization and Control (math.OC) #Power System Optimization and Stability #Power System Reliability and Maintenance

paper · pdf · doi:10.48550/arxiv.2305.01395

openalex publication_date 2023/05/02 · openalex created_date 2023/05/04 · openalex updated_date 2026/07/28

Abstract

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.

Related

• A Fast and Scalable Iterative Solution of a Socio-Economic Security-Constrained Optimal Power Flow with Two-Stage Post-Contingency Control
• An Exact and Scalable Problem Decomposition for Security-Constrained\n Optimal Power Flow
• Computationally Efficient Solutions for Large-Scale Security-Constrained Optimal Power Flow
• Enhanced Modeling of Contingency Response in Security-constrained Optimal Power Flow
• Plug-n-Play Alternating Projection Algorithm for Large-scale Security\n Constraint Optimal Power Flow