Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published July 2020 | Submitted
Book Section - Chapter Open

Worst-Case Sensitivity of DC Optimal Power Flow Problems

Abstract

In this paper we consider the problem of analyzing the effect a change in the load vector can have on the optimal power generation in a DC power flow model. The methodology is based upon the recently introduced concept of the OPF operator. It is shown that for general network topologies computing the worst-case sensitivities is computationally intractable. However, we show that certain problems involving the OPF operator can be equivalently converted to a graphical discrete optimization problem. Using the discrete formulation, we provide a decomposition algorithm that reduces the computational cost of computing the worst-case sensitivity. A 27-bus numerical example is used to illustrate our results.

Additional Information

© 2020 AACC. This work is funded by NSF grants CCF 1637598, ECCS 1619352, CNS 1545096, ARPA-E through grant DE-AR0000699 and the GRID DATA program, and DTRA through grant HDTRA 1-15-1-0003.

Attached Files

Submitted - 2004.01572.pdf

Files

2004.01572.pdf
Files (587.2 kB)
Name Size Download all
md5:77ae7bc29d4a0d73221ee8a2f0534bc7
587.2 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 20, 2023