A Non-iterative Solution Method for DC Optimal Power Flow Based on Holomorphic Embedding

Optimal power flow (OPF) calculation is important in power system operation, but the conventional iterative solvers are sensitive to the initial guess and suffer from the computational burden caused by updating the Jacobian matrix in each iteration. To tackle these problems, the holomorphic embedding (HE) method is developed and shows great performance in power flow analysis. This paper proposes a holomorphic embed-ding method to solve the DC OPF with an initial guess selection based on the primitive economic dispatch. The corresponding Karush-Kuhn-Tucker (KKT) conditions are reconstructed by embedding a complex variable and expanding variables into power series. The numerical solution can be obtained by solving the coefficients using the derived recursion equations and conducting Padé Approximant. The proposed method has been tested in five cases with different scales. This method is numerically validated to be effective and accurate, and shows greater convergent speed than the Matpower Interior Point Solver.