An efficient interior point method for sequential quadraticprogramming based optimal power flow

摘要

This paper presents a new sequential quadratic programmingnalgorithm for solving the optimal power flow problem. The algorithm isnstructured with an outer linearization loop and an inner optimizationnloop. The inner loop solves a relaxed reduced quadratic programmingnproblem. Because constraint relaxation keeps the inner loop problem ofnsmall dimension, the algorithm is quite efficient. Its outer loopniteration counts are comparable to Newton power flow and the inner loopsnare efficient interior point iterations. Several IEEE test systems werenrun. The results indicate that both outer and inner loop iterationncounts do not vary greatly with problem size