Optimization Online


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

Daniel Bienstock (dano***at***columbia.edu)
Abhinav Verma (av2140***at***columbia.edu)

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

Keywords: combinatorial optimization, power grid analysis

Category 1: Applications -- Science and Engineering (Basic Sciences Applications )

Category 2: Combinatorial Optimization (Polyhedra )

Category 3: Integer Programming

Citation: Columbia University, July 2008

Download: [PDF]

Entry Submitted: 08/01/2008
Entry Accepted: 08/01/2008
Entry Last Modified: 08/30/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society