English

Worst-Case Sensitivity of DC Optimal Power Flow Problems

Optimization and Control 2020-04-06 v1 Systems and Control Systems and Control

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\mathcal{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\mathcal{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.

Keywords

Cite

@article{arxiv.2004.01572,
  title  = {Worst-Case Sensitivity of DC Optimal Power Flow Problems},
  author = {James Anderson and Fengyu Zhou and Steven H. Low},
  journal= {arXiv preprint arXiv:2004.01572},
  year   = {2020}
}
R2 v1 2026-06-23T14:38:19.586Z