The N-K Problem in Power Grids: New Models, Formulations and Numerical Experiments (extended version)
Daniel Bienstock, Abhinav Verma

TL;DR
This paper investigates the N-k problem in power grids, presenting new models and computational experiments to understand how the removal of a small set of network components can cause system failure.
Contribution
It introduces novel mixed-integer and nonlinear models for analyzing the N-k problem in power grids, advancing both theoretical understanding and computational methods.
Findings
New mixed-integer model for N-k problem
Continuous nonlinear model related to power grid failures
Computational experiments demonstrating model effectiveness
Abstract
Given a power grid modeled by a network together with equations describing the power flows, power generation and consumption, and the laws of physics, the so-called N-k problem asks whether there exists a set of k or fewer arcs whose removal will cause the system to fail. The case where k is small is of practical interest. We present theoretical and computational results involving a mixed-integer model and a continuous nonlinear model related to this question.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimal Power Flow Distribution · Power System Optimization and Stability · Numerical methods for differential equations
