An Optimal Power Flow Formulation with SOCP Relaxation in Radial Network∗

作者：Chen Y; Li Y; Xiang J; Shen X

来源：14th IEEE International Conference on Control and Automation, ICCA 2018, 2018-06-12 To 2018-06-15.

DOI：10.1109/ICCA.2018.8444210

The optimal power flow (OPF) is a non-linear and non-convex problem that seeks the optimization of a power system operation point to minimize the total generation cost or transmission loss. In this paper, an optimal power flow formulation for radial networks is proposed from the bus injection model. By inducing the branch variables in the model, the relaxation is based on, instead of a big network structure, small branch matrices. Through two steps, it transforms the quartic and non-convex constraints into some linear equations and convexifies the other constraints which cannot be linearized. In the first step, we focus on the equation constraints and reformulate the equations with branch variables. In the second step, we apply SOCP relaxations to inequality constraints. This way, the OPF problem is a convex optimization problem that the local optimum solution is the global optimum solution. The relaxation is tight and equals to the former OPF problem in the radial network in the case study with the standard IEEE benchmark systems. By comparing the simulating time, we find this method calculates faster than OPF with SDP relaxation method.

• 出版日期2018
• 单位浙江大学; 浙江大学城市学院