Homogeneous interior point method for constrained power scheduling

A method for solving the active power economic dispatch problem is presented. The problem is formulated as a convex program which allows the inclusion of a second-order network model, phase shifters and operational constraints. An accurate representation of the line losses is achieved the through the second-order model. The problem is solved using a homogeneous interior point (HIP) algorithm. The HIP algorithm yields either an approximate global optimum or detects the possible infeasibility or unboundedness of the problem. Moreover, this algorithm does not require any skill for setting a propel starting point. The algorithm is tested on standard IEEE networks and on a practical network. Computational experience shows that the method is efficient.