English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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&#x0027;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 <italic>supporting hyperplanes and halfspaces</italic>. The algorithm is numerically demonstrated to converge on 138 test cases with up the 3375 buses to feasible high-quality solutions (i) <italic>without</italic> AC feasibility restoration (i.e., using LP solvers exclusively), (ii) in computation times generally within the same order of magnitude as those from a state-of-the-art NLP solver, and (iii) with robustness against the choice of starting point. In particular, the (relative) optimality gaps and the mean constraint violations are on average around <inline-formula><tex-math notation="LaTeX">$10^{-3}$</tex-math></inline-formula>&#x0025; and <inline-formula><tex-math notation="LaTeX">$10^{-7}$</tex-math></inline-formula>, respectively, under a <italic>single</italic> parameter setting for all the 138 test cases. To the best of our knowledge, the proposed SLP approach is the first to use LP exclusively to reach <italic>feasible</italic> and high-quality solutions to the nonconvex AC OPF in a reliable way, which paves the way for system and market operators to keep using their LP solvers but now with the ability to accurately capture transmission losses, price reactive power (Q-LMP), and obtain more accurate LMP.

An Exact Sequential Linear Programming Algorithm for the Optimal Power Flow Problem