THE N-k PROBLEM IN POWER GRIDS: NEW MODELS, FORMULATIONS, AND NUMERICAL EXPERIMENTS

被引：106

作者：

Bienstock, Daniel ^{[1
]}

Verma, Abhinav ^{[1
]}

机构：

[1] Columbia Univ, New York, NY 10027 USA

来源：

SIAM JOURNAL ON OPTIMIZATION | 2010年 / 20卷 / 05期

关键词：

discrete optimization; nonconvex optimization; power grids; STRATEGIES; SOLVE;

D O I：

10.1137/08073562X

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Given a power grid modeled by a network together with equations describing power flows, power generation and consumption, 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 numerical results involving a mixed-integer linear model and a continuous nonlinear model related to this problem.

引用

页码：2352 / 2380

页数：29

共 30 条

[1]

Ahuja R., 1993, NETWORK FLOWS THEORY

[2]

Alvarez R., 2004, THESIS US NAVAL POST

[3]

Andersson Goran., 2004, MODELLING ANAL ELECT

[4] On the solution of the bilevel programming formulation of the terrorist threat problem [J].