Strong NP-hardness of AC power flows feasibility
From MaRDI portal
Publication:2294366
DOI10.1016/J.ORL.2019.08.009zbMATH Open1476.90070arXiv1512.07315OpenAlexW2972389776MaRDI QIDQ2294366FDOQ2294366
Daniel Bienstock, Abhinav Verma
Publication date: 10 February 2020
Published in: Operations Research Letters (Search for Journal in Brave)
Abstract: We present a rigorous proof of strong NP-hardness of the AC-OPF problem.
Full work available at URL: https://arxiv.org/abs/1512.07315
Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Graph minors. II. Algorithmic aspects of tree-width
- Fast Multiple-Precision Evaluation of Elementary Functions
- Lagrangian duality and branch-and-bound algorithms for optimal power flow
- Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- Electrical Transmission System Cascades and Vulnerability
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- LP Formulations for Polynomial Optimization Problems
Cited In (10)
- Operations research in optimal power flow: a guide to recent and emerging methodologies and applications
- A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems
- A survey on conic relaxations of optimal power flow problem
- Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow
- Graphical models for optimal power flow
- Survey of optimization models for power system operation and expansion planning with demand response
- Mathematical programming formulations for the alternating current optimal power flow problem
- Mathematical programming formulations for the alternating current optimal power flow problem
- A generalised approach for efficient computation of look ahead security constrained optimal power flow
- Algorithmic mechanism design with investment
Recommendations
- Modelling the Power Supply Network – Hardness and Approximation 👍 👎
- A Linear-Programming Approximation of AC Power Flows 👍 👎
- Probabilistically Robust AC Optimal Power Flow 👍 👎
- Strong SOCP Relaxations for the Optimal Power Flow Problem 👍 👎
- Convex Restriction of Power Flow Feasibility Sets 👍 👎
- Designing AC power grids using integer linear programming 👍 👎
- Combinatorial Optimization of AC Optimal Power Flow With Discrete Demands in Radial Networks 👍 👎
- AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization 👍 👎
- Asymptotically tight conic approximations for chance-constrained AC optimal power flow 👍 👎
This page was built for publication: Strong NP-hardness of AC power flows feasibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294366)
