An Exact Sequential Linear Programming Algorithm for the Optimal Power Flow Problem
Sleiman, Mhanna, Pierluigi, Mancarella

TL;DR
This paper introduces an exact sequential linear programming algorithm for the AC optimal power flow problem, achieving high-quality solutions with LP methods that are reliable, efficient, and accurate, even for large systems.
Contribution
It presents the first LP-only method that reliably solves the nonconvex AC OPF with high accuracy, bridging the gap between LP efficiency and NLP accuracy.
Findings
Converges on 138 test cases with up to 3375 buses.
Achieves optimality gaps around 0.001% and constraint violations near 1e-7.
Computational times comparable to state-of-the-art NLP solvers.
Abstract
Despite major advancements in nonlinear programming (NLP) and convex relaxations, most system operators around the world still predominantly use some form of linear programming (LP) approximation of the AC power flow equations. This is largely due to LP technology's superior reliability and computational efficiency, especially in real-time market applications, security-constrained applications, and extensions involving integer variables, in addition to its ability to readily generate locational marginal prices (LMP) for market applications. In the aim of leveraging the advantages of LP while retaining the accuracy of NLP interior-point methods (IPMs), this paper proposes a sequential linear programming (SLP) approach consisting of a sequence of carefully constructed supporting hyperplanes and halfspaces. The algorithm is numerically demonstrated to converge on 138 test cases with up the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
