IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v194y2022i1d10.1007_s10957-022-02029-8.html
   My bibliography  Save this article

Tight Convex Relaxations for the Expansion Planning Problem

Author

Listed:
  • Ralf Lenz

    (Zuse Institute Berlin)

  • Felipe Serrano

    (Zuse Institute Berlin)

Abstract

Secure energy transport is considered as highly relevant for the basic infrastructure of nowadays society and economy. To satisfy increasing demands and to handle more diverse transport situations, operators of energy networks regularly expand the capacity of their network by building new network elements, known as the expansion planning problem. A key constraint function in expansion planning problems is a nonlinear and nonconvex potential loss function. In order to improve the algorithmic performance of state-of-the-art MINLP solvers, this paper presents an algebraic description for the convex envelope of this function. Through a thorough computational study, we show that this tighter relaxation tremendously improves the performance of the MINLP solver SCIP on a large test set of practically relevant instances for the expansion planning problem. In particular, the results show that our achievements lead to an improvement of the solver performance for a development version by up to 58%.

Suggested Citation

  • Ralf Lenz & Felipe Serrano, 2022. "Tight Convex Relaxations for the Expansion Planning Problem," Journal of Optimization Theory and Applications, Springer, vol. 194(1), pages 325-352, July.
    • Handle: RePEc:spr:joptap:v:194:y:2022:i:1:d:10.1007_s10957-022-02029-8
    DOI: 10.1007/s10957-022-02029-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-022-02029-8
    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/s10957-022-02029-8?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. Marco Locatelli, 2018. "Convex envelopes of bivariate functions through the solution of KKT systems," Journal of Global Optimization, Springer, vol. 72(2), pages 277-303, October.
    2. Shiono, Naoshi & Suzuki, Hisatoshi, 2016. "Optimal pipe-sizing problem of tree-shaped gas distribution networks," European Journal of Operational Research, Elsevier, vol. 252(2), pages 550-560.
    3. Conrado Borraz-Sánchez & Russell Bent & Scott Backhaus & Hassan Hijazi & Pascal Van Hentenryck, 2016. "Convex Relaxations for Gas Expansion Planning," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 645-656, November.
    4. Frauke Liers & Alexander Martin & Maximilian Merkert & Nick Mertens & Dennis Michaels, 2021. "Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks," Journal of Global Optimization, Springer, vol. 80(2), pages 307-340, June.
    5. Andre, Jean & Bonnans, Frédéric & Cornibert, Laurent, 2009. "Optimization of capacity expansion planning for gas transportation networks," European Journal of Operational Research, Elsevier, vol. 197(3), pages 1019-1027, September.
    6. Faiz A. Al-Khayyal & James E. Falk, 1983. "Jointly Constrained Biconvex Programming," Mathematics of Operations Research, INFORMS, vol. 8(2), pages 273-286, May.
    Full references (including those not matched with items on IDEAS)

    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. Ralf Lenz & Kai Helge Becker, 2022. "Optimization of capacity expansion in potential-driven networks including multiple looping: a comparison of modelling approaches," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 179-224, March.
    2. Mengying Xue & Tianhu Deng & Zuo‐Jun Max Shen, 2019. "Optimizing natural gas pipeline transmission with nonuniform elevation: A new initialization approach," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(7), pages 547-564, October.
    3. Wei, Qi & Zhou, Peng & Shi, Xunpeng, 2023. "The congestion cost of pipeline networks under third-party access in China's natural gas market," Energy, Elsevier, vol. 284(C).
    4. Jingkuan Han & Yingjun Xu & Dingzhi Liu & Yanfang Zhao & Zhongde Zhao & Shuhui Zhou & Tianhu Deng & Mengying Xue & Junchi Ye & Zuo-Jun Max Shen, 2019. "Operations Research Enables Better Planning of Natural Gas Pipelines," Interfaces, INFORMS, vol. 49(1), pages 23-39, January.
    5. Martin Robinius & Lars Schewe & Martin Schmidt & Detlef Stolten & Johannes Thürauf & Lara Welder, 2019. "Robust optimal discrete arc sizing for tree-shaped potential networks," Computational Optimization and Applications, Springer, vol. 73(3), pages 791-819, July.
    6. repec:cty:dpaper:10.1080/0013791x.2011.573615 is not listed on IDEAS
    7. Fambri, Gabriele & Diaz-Londono, Cesar & Mazza, Andrea & Badami, Marco & Sihvonen, Teemu & Weiss, Robert, 2022. "Techno-economic analysis of Power-to-Gas plants in a gas and electricity distribution network system with high renewable energy penetration," Applied Energy, Elsevier, vol. 312(C).
    8. Liang, Yingzong & Hui, Chi Wai, 2018. "Convexification for natural gas transmission networks optimization," Energy, Elsevier, vol. 158(C), pages 1001-1016.
    9. Shiono, Naoshi & Suzuki, Hisatoshi & Saruwatari, Yasufumi, 2019. "A dynamic programming approach for the pipe network layout problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 52-61.
    10. İhsan Yanıkoğlu & Erinç Albey & Serkan Okçuoğlu, 2022. "Robust Parameter Design and Optimization for Quality Engineering," SN Operations Research Forum, Springer, vol. 3(1), pages 1-36, March.
    11. Ordoudis, Christos & Pinson, Pierre & Morales, Juan M., 2019. "An Integrated Market for Electricity and Natural Gas Systems with Stochastic Power Producers," European Journal of Operational Research, Elsevier, vol. 272(2), pages 642-654.
    12. Eli Towle & James Luedtke, 2018. "New solution approaches for the maximum-reliability stochastic network interdiction problem," Computational Management Science, Springer, vol. 15(3), pages 455-477, October.
    13. N. V. Thoai, 2000. "Duality Bound Method for the General Quadratic Programming Problem with Quadratic Constraints," Journal of Optimization Theory and Applications, Springer, vol. 107(2), pages 331-354, November.
    14. repec:cty:dpaper:1464 is not listed on IDEAS
    15. Radu Baltean-Lugojan & Ruth Misener, 2018. "Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness," Journal of Global Optimization, Springer, vol. 71(4), pages 655-690, August.
    16. Evrim Dalkiran & Hanif Sherali, 2013. "Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality," Journal of Global Optimization, Springer, vol. 57(4), pages 1147-1172, December.
    17. M. M. Faruque Hasan, 2018. "An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems," Journal of Global Optimization, Springer, vol. 71(4), pages 735-752, August.
    18. Amir Ahmadi-Javid & Pooya Hoseinpour, 2022. "Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2621-2633, September.
    19. Gabriele Eichfelder & Peter Kirst & Laura Meng & Oliver Stein, 2021. "A general branch-and-bound framework for continuous global multiobjective optimization," Journal of Global Optimization, Springer, vol. 80(1), pages 195-227, May.
    20. Ordoudis, Christos & Delikaraoglou, Stefanos & Kazempour, Jalal & Pinson, Pierre, 2020. "Market-based coordination of integrated electricity and natural gas systems under uncertain supply," European Journal of Operational Research, Elsevier, vol. 287(3), pages 1105-1119.
    21. Conrado Borraz-Sánchez & Russell Bent & Scott Backhaus & Hassan Hijazi & Pascal Van Hentenryck, 2016. "Convex Relaxations for Gas Expansion Planning," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 645-656, November.
    22. Anna Schwele & Christos Ordoudis & Pierre Pinson & Jalal Kazempour, 2021. "Coordination of power and natural gas markets via financial instruments," Computational Management Science, Springer, vol. 18(4), pages 505-538, October.

    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:joptap:v:194:y:2022:i:1:d:10.1007_s10957-022-02029-8. 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.