IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v286y2020i1d10.1007_s10479-018-3012-y.html
   My bibliography  Save this article

Interior/exterior-point methods with inertia correction strategy for solving optimal reactive power flow problems with discrete variables

Author

Listed:
  • Marielena Fonseca Tófoli

    (Universidade Estadual Paulista (Unesp))

  • Edilaine Martins Soler

    (Universidade Estadual Paulista (Unesp))

  • Antonio Roberto Balbo

    (Universidade Estadual Paulista (Unesp))

  • Edméa Cássia Baptista

    (Universidade Estadual Paulista (Unesp))

  • Leonardo Nepomuceno

    (Universidade Estadual Paulista (Unesp))

Abstract

Interior/exterior-point methods have been widely used for solving Optimal Reactive Power Flow problems (ORPF). However, the utilization of such methods becomes difficult when transformer taps and/or capacitor/reactor banks are more rigorously represented in the problem formulation by means of discrete control variables. This work investigates the solution of the ORPF problem when transformer tap ratios are modeled as discrete variables. The solution method proposed handles discrete variables by means of sinusoidal penalty function, while the penalized problems are solved by an exterior-point method. An inertia correction strategy is proposed in order to assure that only local minima are obtained for the penalized problems. New search directions are also investigated that combine predictor and corrector directions. Numerical simulations are performed involving the IEEE 14, 30 and 57 bus systems. The results show the efficiency of the proposed inertia correction strategy and also reveals that the proposed exterior-point method outperforms traditional interior-point methods in terms of the number of iterations and computation times.

Suggested Citation

  • Marielena Fonseca Tófoli & Edilaine Martins Soler & Antonio Roberto Balbo & Edméa Cássia Baptista & Leonardo Nepomuceno, 2020. "Interior/exterior-point methods with inertia correction strategy for solving optimal reactive power flow problems with discrete variables," Annals of Operations Research, Springer, vol. 286(1), pages 243-263, March.
    • Handle: RePEc:spr:annopr:v:286:y:2020:i:1:d:10.1007_s10479-018-3012-y
    DOI: 10.1007/s10479-018-3012-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-018-3012-y
    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/s10479-018-3012-y?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.

    References listed on IDEAS

    as
    1. David G. Luenberger & Yinyu Ye, 2008. "Linear and Nonlinear Programming," International Series in Operations Research and Management Science, Springer, edition 0, number 978-0-387-74503-9, March.
    2. R. Polyak & I. Griva, 2004. "Primal-Dual Nonlinear Rescaling Method for Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 122(1), pages 111-156, July.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Lenin Kanagasabai, 2022. "Real power loss reduction by North American sapsucker algorithm," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(1), pages 143-153, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alp Atakan & Mehmet Ekmekci & Ludovic Renou, 2021. "Cross-verification and Persuasive Cheap Talk," Papers 2102.13562, arXiv.org, revised Apr 2021.
    2. Tanaka, Ken'ichiro & Toda, Alexis Akira, 2015. "Discretizing Distributions with Exact Moments: Error Estimate and Convergence Analysis," University of California at San Diego, Economics Working Paper Series qt7g23r5kh, Department of Economics, UC San Diego.
    3. Ashrafi, M. & Khanjani, M.J. & Fadaei-Kermani, E. & Barani, G.A., 2015. "Farm drainage channel network optimization by improved modified minimal spanning tree," Agricultural Water Management, Elsevier, vol. 161(C), pages 1-8.
    4. Sergey Badikov & Antoine Jacquier & Daphne Qing Liu & Patrick Roome, 2016. "No-arbitrage bounds for the forward smile given marginals," Papers 1603.06389, arXiv.org, revised Oct 2016.
    5. Szidarovszky, Ferenc & Luo, Yi, 2014. "Incorporating risk seeking attitude into defense strategy," Reliability Engineering and System Safety, Elsevier, vol. 123(C), pages 104-109.
    6. Rafał Wiśniowski & Krzysztof Skrzypaszek & Tomasz Małachowski, 2020. "Selection of a Suitable Rheological Model for Drilling Fluid Using Applied Numerical Methods," Energies, MDPI, vol. 13(12), pages 1-17, June.
    7. Yuichi Takano & Renata Sotirov, 2012. "A polynomial optimization approach to constant rebalanced portfolio selection," Computational Optimization and Applications, Springer, vol. 52(3), pages 645-666, July.
    8. Nadia Demarteau & Thomas Breuer & Baudouin Standaert, 2012. "Selecting a Mix of Prevention Strategies against Cervical Cancer for Maximum Efficiency with an Optimization Program," PharmacoEconomics, Springer, vol. 30(4), pages 337-353, April.
    9. Vittorio Nicolardi, 2013. "Simultaneously Balancing Supply--Use Tables At Current And Constant Prices: A New Procedure," Economic Systems Research, Taylor & Francis Journals, vol. 25(4), pages 409-434, December.
    10. Alina R. Battalova* & Nadezhda A. Opokina, 2018. "Economic-Mathematical Model of the Structure of Nutrition of Population in the Region," The Journal of Social Sciences Research, Academic Research Publishing Group, pages 275-280:1.
    11. Hee Su Roh & Yinyu Ye, 2015. "Market Making with Model Uncertainty," Papers 1509.07155, arXiv.org, revised Nov 2015.
    12. Takafumi Kanamori & Akiko Takeda, 2014. "Numerical study of learning algorithms on Stiefel manifold," Computational Management Science, Springer, vol. 11(4), pages 319-340, October.
    13. Minghui Lai & Weili Xue & Qian Hu, 2019. "An Ascending Auction for Freight Forwarder Collaboration in Capacity Sharing," Transportation Science, INFORMS, vol. 53(4), pages 1175-1195, July.
    14. Joao R. Faria & Peter Mcadam & Bruno Viscolani, 2023. "Monetary Policy, Neutrality, and the Environment," Journal of Money, Credit and Banking, Blackwell Publishing, vol. 55(7), pages 1889-1906, October.
    15. Da Tian, 2014. "An entire space polynomial-time algorithm for linear programming," Journal of Global Optimization, Springer, vol. 58(1), pages 109-135, January.
    16. Lee, Sunghoon & Yun, Seokwon & Kim, Jin-Kuk, 2019. "Development of novel sub-ambient membrane systems for energy-efficient post-combustion CO2 capture," Applied Energy, Elsevier, vol. 238(C), pages 1060-1073.
    17. G. Constante-Flores & A. J. Conejo & S. Constante-Flores, 2022. "Solving certain complementarity problems in power markets via convex programming," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(3), pages 465-491, October.
    18. I. Espejo & R. Páez & J. Puerto & A. M. Rodríguez-Chía, 2022. "Minimum cost b-matching problems with neighborhoods," Computational Optimization and Applications, Springer, vol. 83(2), pages 525-553, November.
    19. Mengyi Ying & Min Sun, 2017. "Some feasibility sampling procedures in interval methods for constrained global optimization," Journal of Global Optimization, Springer, vol. 67(1), pages 379-397, January.
    20. Jia Wu & Yi Zhang & Liwei Zhang & Yue Lu, 2016. "A Sequential Convex Program Approach to an Inverse Linear Semidefinite Programming Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-26, August.

    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:annopr:v:286:y:2020:i:1:d:10.1007_s10479-018-3012-y. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.