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

  • Daniel Bienstock
  • Abhinav Verma
    • Categories Basic Sciences Applications, Integer Programming, Polyhedra Tags , Short URL: https://optimization-online.org/?p=10500

    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.

    Citation

    Columbia University, July 2008

    Article

    Download

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