Optimal power flow under stochastic N-1 disruptions in electric transmission grids

We consider a multi-period optimal power flow (OPF) problem in transmission systems with a generic network topology subject to stochastic N - 1 contingencies (disruptions). We propose a multi-stage stochastic convex programming formulation for such a disruption problem and solve it using an efficient decomposition algorithm. We compare the disruption optimization formulation with the conventional N - 1 securityconstrained OPF formulation and show that our proposed model can utilize the generation resource more efficiently in a realistic contingency setting. We also present computational results comparing multiple convex relaxation schemes of the non-convex alternating current OPF (ACOPF) problem in transmission networks under stochastic disruptions. Through this, we provide insights on the performance of the policy trained by convex relaxations of an ACOPF problem.