The $N-k$ Problem in Power Grids: New Models, Formulations, and Numerical Experiments
From MaRDI portal
Publication:3083290
DOI10.1137/08073562XzbMath1211.90140arXiv0912.5233MaRDI QIDQ3083290
Bienstock, Daniel, Abhinav Verma
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0912.5233
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items (14)
A trilevel programming approach for electric grid defense planning ⋮ Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty ⋮ A Linear-Programming Approximation of AC Power Flows ⋮ Convex quadratic relaxations for mixed-integer nonlinear programs in power systems ⋮ A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid ⋮ Algorithm for the N-2 Security-Constrained Unit Commitment Problem with Transmission Switching ⋮ A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ Contingency-constrained unit commitment with post-contingency corrective recourse ⋮ Electric transmission lines: Control and numerical discretization ⋮ Resilient layout, design and operation of energy-efficient water distribution networks for high-rise buildings using MINLP ⋮ A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems ⋮ A Lagrangian dual method for two-stage robust optimization with binary uncertainties ⋮ Large-scale unit commitment under uncertainty
Uses Software
This page was built for publication: The $N-k$ Problem in Power Grids: New Models, Formulations, and Numerical Experiments
