Semidefinite programming for optimal power flow problems

doi:10.1016/j.ijepes.2007.12.003

Semidefinite programming for optimal power flow problems

2008-07-01

485

PRE

AI

DOI：10.1016/j.ijepes.2007.12.003

Original

Original request for help

Save

Abstract

En 中文

This paper presents a new solution using the semidefinite programming (SDP) technique to solve the optimal power flow problems (OPF). The proposed method involves reformulating the OPF problems into a SDP model and developing an algorithm of interior point method (IPM) for SDP. That is said, OPF in a nonlinear programming (NP) model, which is a nonconvex problem, has been accurately transformed into a SDP model which is a convex problem. Based on SDP, the OPF problem can be solved by primal-dual interior point algorithms which possess superlinear convergence. The proposed method has been tested with four kinds of objective functions of OPF. Extensive numerical simulations on test systems with sizes ranging from 4 to 300 buses have shown that this method is promising for OPF problems due to its robustness. (C) 2008 Published by Elsevier Ltd.

Keywords:

optimal power flow

interior point method

semidefinite programming

Semidefinite programming for optimal power flow problems

Abstract

Journal

Organization