IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v60y2012i2p275-285.html
   My bibliography  Save this article

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

Author

Listed:
  • Dzung T. Phan

    (Department of Business Analytics and Mathematical Sciences, IBM T. J. Watson Research Center, Yorktown Heights, New York 10598)

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.

Suggested Citation

  • Dzung T. Phan, 2012. "Lagrangian Duality and Branch-and-Bound Algorithms for Optimal Power Flow," Operations Research, INFORMS, vol. 60(2), pages 275-285, April.
    • Handle: RePEc:inm:oropre:v:60:y:2012:i:2:p:275-285
    DOI: 10.1287/opre.1110.1036
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1110.1036
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1110.1036?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Guanglei Wang & Hassan Hijazi, 2018. "Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches," Computational Optimization and Applications, Springer, vol. 71(2), pages 553-608, November.
    2. Zohrizadeh, Fariba & Josz, Cedric & Jin, Ming & Madani, Ramtin & Lavaei, Javad & Sojoudi, Somayeh, 2020. "A survey on conic relaxations of optimal power flow problem," European Journal of Operational Research, Elsevier, vol. 287(2), pages 391-409.
    3. Kursad Derinkuyu & Fehmi Tanrisever & Nermin Kurt & Gokhan Ceyhan, 2020. "Optimizing Day-Ahead Electricity Market Prices: Increasing the Total Surplus for Energy Exchange Istanbul," Manufacturing & Service Operations Management, INFORMS, vol. 22(4), pages 700-716, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:60:y:2012:i:2:p:275-285. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.