Strong NP-hardness of AC power flows feasibility

DOI10.1016/j.orl.2019.08.009zbMath1476.90070arXiv1512.07315OpenAlexW2972389776MaRDI QIDQ2294366

Abhinav Verma, Bienstock, Daniel

Publication date: 10 February 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.07315

zbMATH Keywords

NP-completenessapproximation algorithmspower flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (9)

Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow ⋮ Survey of optimization models for power system operation and expansion planning with demand response ⋮ A generalised approach for efficient computation of look ahead security constrained optimal power flow ⋮ Graphical models for optimal power flow ⋮ A survey on conic relaxations of optimal power flow problem ⋮ Mathematical programming formulations for the alternating current optimal power flow problem ⋮ Mathematical programming formulations for the alternating current optimal power flow problem ⋮ A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems ⋮ Operations research in optimal power flow: a guide to recent and emerging methodologies and applications

Cites Work

• Unnamed Item
• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
• Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
• Lagrangian Duality and Branch-and-Bound Algorithms for Optimal Power Flow
• Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
• Electrical Transmission System Cascades and Vulnerability
• Graph minors. II. Algorithmic aspects of tree-width
• Fast Multiple-Precision Evaluation of Elementary Functions
• LP Formulations for Polynomial Optimization Problems

This page was built for publication: Strong NP-hardness of AC power flows feasibility