Minimum loss optimization in distribution systems: discrete ascent optimal programming

A new algorithm, discrete ascent optimal programming, for optimal power flow in distribution systems is presented. The new algorithm will converge to the same solution as the Lagrange multiplier approach, as demonstrated by example. An intuitive discussion illustrating the path of convergence is presented along with a theorem concerning convergence. The algorithm is explained with two DC examples which illustrate both unconstrained and constrained solutions. A switch placement design problem is also solved. Advantages of the new algorithm include its simplicity, ease of incorporating inequality constraints, and the ability to predict the number of steps required for convergence.