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

Dzung T. Phan ()
Additional contact information
Dzung T. Phan: Department of Business Analytics and Mathematical Sciences, IBM T. J. Watson Research Center, Yorktown Heights, New York 10598

Operations Research, 2012, vol. 60, issue 2, 275-285

Abstract: This paper investigates a Lagrangian dual problem for solving the optimal power flow problem in rectangular form that arises from power system analysis. If strong duality does not hold for the dual, we propose two classes of branch-and-bound algorithms that guarantee to solve the problem to optimality. The lower bound for the objective function is obtained by the Lagrangian duality, whereas the feasible set subdivision is based on the rectangular or ellipsoidal bisection. The numerical experiments are reported to demonstrate the effectiveness of the proposed algorithms. We note that no duality gap is observed for any of our test problems.

Keywords: optimal power flow; branch-and-bound; Lagrangian duality; quadratic programming; global optimization (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1110.1036 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:60:y:2012:i:2:p:275-285

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().