arXiv Analytics

Sign in

arXiv:0912.5233 [math.OC]AbstractReferencesReviewsResources

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

Daniel Bienstock, Abhinav Verma

Published 2009-12-29, updated 2009-12-31Version 2

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.

Comments: 40 pages 3 figures
Categories: math.OC
Subjects: 90-08
Related articles: Most relevant | Search more
arXiv:1304.0356 [math.OC] (Published 2013-04-01)
Robustness of Interdependent Networks: The case of communication networks and the power grid
arXiv:1503.04093 [math.OC] (Published 2015-03-13)
Value of forecasts in planning under uncertainty: Extended version
arXiv:1705.02370 [math.OC] (Published 2017-05-04)
Improved Spectral Clustering for Multi-Objective Controlled Islanding of Power Grid