IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v72y2018i3d10.1007_s10898-018-0652-z.html
   My bibliography  Save this article

Globally solving a class of optimal power flow problems in radial networks by tree reduction

Author

Listed:
  • Amir Beck

    (Tel Aviv University)

  • Yuval Beck

    (Tel-Aviv University)

  • Yoash Levron

    (Technion - Israel Institute of Technology)

  • Alex Shtof

    (Technion - Israel Institute of Technology)

  • Luba Tetruashvili

    (Technion - Israel Institute of Technology)

Abstract

We devise an algorithm for finding the global optimal solution of the so-called optimal power flow problem for a class of power networks with a tree topology, also called radial networks, for which an efficient and reliable algorithm was not previously known. The algorithm we present is called the tree reduction/expansion method, and is based on an equivalence between the input network and a single-node network. Finally, our numerical experiments demonstrate the reliability and robustness of our algorithm.

Suggested Citation

  • Amir Beck & Yuval Beck & Yoash Levron & Alex Shtof & Luba Tetruashvili, 2018. "Globally solving a class of optimal power flow problems in radial networks by tree reduction," Journal of Global Optimization, Springer, vol. 72(3), pages 373-402, November.
    • Handle: RePEc:spr:jglopt:v:72:y:2018:i:3:d:10.1007_s10898-018-0652-z
    DOI: 10.1007/s10898-018-0652-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-018-0652-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-018-0652-z?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Daniel Bienstock & Mauro Escobar & Claudio Gentile & Leo Liberti, 2022. "Mathematical programming formulations for the alternating current optimal power flow problem," Annals of Operations Research, Springer, vol. 314(1), pages 277-315, July.
    2. Dan Bienstock & Mauro Escobar & Claudio Gentile & Leo Liberti, 2020. "Mathematical programming formulations for the alternating current optimal power flow problem," 4OR, Springer, vol. 18(3), pages 249-292, September.

    More about this item

    Statistics

    Access and download statistics

    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:spr:jglopt:v:72:y:2018:i:3:d:10.1007_s10898-018-0652-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.