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 $\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 $\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.

中文翻译：

---

直流最优潮流问题的最坏情况敏感性

在本文中，我们考虑分析负载矢量变化对直流潮流模型中最佳发电的影响的问题。该方法基于最近引入的 $\mathcal{OPF}$ 运算符的概念。结果表明，对于一般网络拓扑计算，最坏情况的敏感性在计算上是难以处理的。但是，我们表明某些涉及 $\mathcal{OPF}$ 运算符的问题可以等效地转换为图形离散优化问题。使用离散公式，我们提供了一种分解算法，可降低计算最坏情况灵敏度的计算成本。使用 27 总线数值示例来说明我们的结果。