An efficient interior point method for sequential quadratic programming based optimal power flow

This paper presents a new sequential quadratic programming algorithm for so lving the optimal power flow problem. The algorithm is structured with an o uter linearization loop and an inner optimization loop. The inner loop solv es a relaxed reduced quadratic programming problem. Because constraint rela xation keeps the inner loop problem of small dimension, the algorithm is qu ite efficient. Its outer loop iteration counts are comparable to Newton pow er flow, and the inner loops are efficient interior point iterations. Sever al IEEE test systems were run. The results indicate that both outer and inn er loop iteration counts do not vary greatly with problem size.