2018/09/12 by Kaarthik Sundar, Sundar, Kaarthik, Harsha Nagarajan +9 · 2 citations
Engineering · #FOS: Electrical engineering #FOS: Mathematics #Microgrid Control and Optimization #Optimal Power Flow Distribution #Optimization and Control (math.OC) #Power System Reliability and Maintenance #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.1809.04565
openalex publication_date 2018/09/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This article develops a strengthened convex quadratic convex (QC) relaxation of the AC Optimal Power Flow (AC-OPF) problem and presents an optimization-based bound-tightening (OBBT) algorithm to compute tight, feasible bounds on the voltage magnitude variables for each bus and the phase angle difference variables for each branch in the network. Theoretical properties of the strengthened QC relaxation that show its dominance over the other variants of the QC relaxation studied in the literature are also derived. The effectiveness of the strengthened QC relaxation is corroborated via extensive numerical results on benchmark AC-OPF test networks. In particular, the results demonstrate that the proposed relaxation consistently provides the tightest variable bounds and optimality gaps with negligible impacts on runtime performance.