Lagrangian Duality-Based Branch and Bound Algorithms for Optimal Power Flow

This paper investigates two classes of branch and bound algorithms for solving the optimal power flow problem in rectangular form which arises from the power system analysis. The lower bound for the objective function is obtained by Lagrangian duality, while the feasible set subdivision is based on the rectangular or ellipsoidal bisection. The numerical experiments are reported to demonstrate the effectiveness of our proposed algorithms. Especially, the zero duality gap is observed for all our test problems.

By: Dzung T. Phan

Published in: Operations Research, volume 60, (no 2), pages 275-85 in 2012

Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.

Questions about this service can be mailed to .