论文标题
直流最佳功率流问题的最差案例灵敏度
Worst-Case Sensitivity of DC Optimal Power Flow Problems
论文作者
论文摘要
在本文中，我们考虑了分析负载矢量变化对DC功率流模型中最佳功率产生的影响的问题。该方法基于$ \ Mathcal {opf} $ operator的最近引入的概念。结果表明，对于一般网络拓扑，计算最坏情况的敏感性在计算上是棘手的。但是，我们表明，涉及$ \ Mathcal {OPF} $运算符的某些问题可以等效地转换为图形离散优化问题。使用离散公式，我们提供了一种分解算法，可降低计算最坏情况灵敏度的计算成本。一个27大型数值示例用于说明我们的结果。
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.
