The N − k Problem in Power Grids : New Models , Formulations and Computation

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. We present theoretical results and computation involving two optimization algorithms for this problem.

[1]  Probability Subcommittee,et al.  IEEE Reliability Test System , 1979, IEEE Transactions on Power Apparatus and Systems.

[2]  李幼升,et al.  Ph , 1989 .

[3]  Hande Y. Benson,et al.  INTERIOR-POINT METHODS FOR NONCONVEX NONLINEAR PROGRAMMING: JAMMING AND COMPARATIVE NUMERICAL TESTING , 2000 .

[4]  Ian Dobson,et al.  Evidence for self-organized criticality in electric power system blackouts , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[5]  Michael William Newman,et al.  The Laplacian spectrum of graphs , 2001 .

[6]  V. E. Lynch,et al.  Critical points and transitions in an electric power transmission model for cascading failure blackouts. , 2002, Chaos.

[7]  Nicholas I. M. Gould,et al.  Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming , 2002, SIAM J. Optim..

[8]  Ian Dobson,et al.  Blackout mitigation assessment in power transmission systems , 2003, 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the.

[9]  B A Carreras,et al.  Complex dynamics of blackouts in power transmission systems. , 2004, Chaos.

[10]  J. Salmeron,et al.  Analysis of electric grid security under terrorist threat , 2004, IEEE Transactions on Power Systems.

[11]  J. Arroyo,et al.  On the solution of the bilevel programming formulation of the terrorist threat problem , 2005, IEEE Transactions on Power Systems.

[12]  Stephen P. Boyd.  Convex optimization of graph Laplacian eigenvalues , 2006 .

[13]  Daniel Bienstock,et al.  Using mixed-integer programming to solve power grid blackout problems , 2007, Discret. Optim..

[14]  Vicki M. Bier,et al.  Methodology for identifying near-optimal interdiction strategies for a power transmission system , 2007, Reliab. Eng. Syst. Saf..

[15]  J. C. Smith,et al.  Algorithms for discrete and continuous multicommodity flow network interdiction problems , 2007 .

[16]  Jeff T. Linderoth,et al.  Reformulation and sampling to solve a stochastic network interdiction problem , 2008, Networks.

[17]  Ted K. Ralphs,et al.  A Branch-and-cut Algorithm for Integer Bilevel Linear Programs , 2009 .