IDEAS home Printed from https://ideas.repec.org/a/spr/aqjoor/v22y2024i4d10.1007_s10288-024-00566-8.html
   My bibliography  Save this article

On supply and network investment in power systems

Author

Listed:
  • Wim Ackooij

    (EDF Lab Paris-Saclay)

  • Nadia Oudjane

    (EDF Lab Paris-Saclay
    FiME (Laboratoire de Finance des Marchés de l’Energie (Dauphine, CREST, EDF R &D))

Abstract

In this work we discuss the question of investment in power systems wherein the need for flexibility would be a driving force for investments. The investment cost itself consists of a capital investment cost and an operational cost, wherein the latter evaluates the cost of operating the system for a given installed capacity. We argue that the operational cost is best dealt with through the use of the Lagrangian dual. Not only does the latter offer clear computational advantages, but it also naturally incorporates precise modelling of “flexibility”. The suggested formalism accounts for accurate models of complex systems. Even though the use of the Lagrangian entails an implicit convexification, we show that if sufficiently many units are to be invested in, the approximation gap vanishes. The laid out computational advantages specific to investment, on top of the well-known decomposition advantages of the Lagrangian, make the suggested formalism, we believe, a serious competitor to balance accuracy and computational performance as investment is concerned.

Suggested Citation

  • Wim Ackooij & Nadia Oudjane, 2024. "On supply and network investment in power systems," 4OR, Springer, vol. 22(4), pages 465-481, December.
    • Handle: RePEc:spr:aqjoor:v:22:y:2024:i:4:d:10.1007_s10288-024-00566-8
    DOI: 10.1007/s10288-024-00566-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10288-024-00566-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/s10288-024-00566-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. Starr, Ross M, 1969. "Quasi-Equilibria in Markets with Non-Convex Preferences," Econometrica, Econometric Society, vol. 37(1), pages 25-38, January.
    2. Wim Ackooij & Jérôme Malick, 2016. "Decomposition algorithm for large-scale two-stage unit-commitment," Annals of Operations Research, Springer, vol. 238(1), pages 587-613, March.
    3. Wim Ackooij, 2014. "Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 80(3), pages 227-253, December.
    4. Wim Ackooij & Jérôme Malick, 2016. "Decomposition algorithm for large-scale two-stage unit-commitment," Annals of Operations Research, Springer, vol. 238(1), pages 587-613, March.
    5. W. Ackooij & I. Danti Lopez & A. Frangioni & F. Lacalandra & M. Tahanan, 2018. "Large-scale unit commitment under uncertainty: an updated literature survey," Annals of Operations Research, Springer, vol. 271(1), pages 11-85, December.
    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. Wim Ackooij & Nicolas Lebbe & Jérôme Malick, 2017. "Regularized decomposition of large scale block-structured robust optimization problems," Computational Management Science, Springer, vol. 14(3), pages 393-421, July.
    2. Alexander Franz & Julia Rieck & Jürgen Zimmermann, 2019. "Fix-and-optimize procedures for solving the long-term unit commitment problem with pumped storages," Annals of Operations Research, Springer, vol. 274(1), pages 241-265, March.
    3. W. Ackooij & X. Warin, 2020. "On conditional cuts for stochastic dual dynamic programming," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 173-199, June.
    4. Clara Lage & Claudia Sagastizábal & Mikhail Solodov, 2020. "Multiplier Stabilization Applied to Two-Stage Stochastic Programs," Documents de travail du Centre d'Economie de la Sorbonne 20010, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    5. Clara Lage & Claudia Sagastizábal & Mikhail Solodov, 2019. "Multiplier Stabilization Applied to Two-Stage Stochastic Programs," Journal of Optimization Theory and Applications, Springer, vol. 183(1), pages 158-178, October.
    6. Clara Lage & Claudia Sagastizábal & Mikhail Solodov, 2020. "Multiplier Stabilization Applied to Two-Stage Stochastic Programs," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-02900862, HAL.
    7. W. Ackooij & A. Frangioni & W. Oliveira, 2016. "Inexact stabilized Benders’ decomposition approaches with application to chance-constrained problems with finite support," Computational Optimization and Applications, Springer, vol. 65(3), pages 637-669, December.
    8. Wim van Ackooij & Welington de Oliveira & Yongjia Song, 2018. "Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 57-70, February.
    9. Clara Lage & Claudia Sagastizábal & Mikhail Solodov, 2020. "Multiplier Stabilization Applied to Two-Stage Stochastic Programs," Post-Print halshs-02900862, HAL.
    10. Pedro Borges, 2022. "Cut-sharing across trees and efficient sequential sampling for SDDP with uncertainty in the RHS," Computational Optimization and Applications, Springer, vol. 82(3), pages 617-647, July.
    11. Guelpa, Elisa & Bischi, Aldo & Verda, Vittorio & Chertkov, Michael & Lund, Henrik, 2019. "Towards future infrastructures for sustainable multi-energy systems: A review," Energy, Elsevier, vol. 184(C), pages 2-21.
    12. Arie Beresteanu & Francesca Molinari, 2008. "Asymptotic Properties for a Class of Partially Identified Models," Econometrica, Econometric Society, vol. 76(4), pages 763-814, July.
    13. Llinares, Juan-Vicente, 1998. "Unified treatment of the problem of existence of maximal elements in binary relations: a characterization," Journal of Mathematical Economics, Elsevier, vol. 29(3), pages 285-302, April.
    14. Martin Bichler & Johannes Knörr & Felipe Maldonado, 2023. "Pricing in Nonconvex Markets: How to Price Electricity in the Presence of Demand Response," Information Systems Research, INFORMS, vol. 34(2), pages 652-675, June.
    15. Nagisa Sugishita & Andreas Grothey & Ken McKinnon, 2024. "Use of Machine Learning Models to Warmstart Column Generation for Unit Commitment," INFORMS Journal on Computing, INFORMS, vol. 36(4), pages 1129-1146, July.
    16. Martin Shubik & Myrna Holtz Wooders, 1982. "Approximate Cores of a General Class of Economies: Part II. Set-Up Costs and Firm Formation in Coalition Production Economies," Cowles Foundation Discussion Papers 619, Cowles Foundation for Research in Economics, Yale University.
    17. Wu, Haoyu & Tang, Ao, 2024. "An even tighter bound for the Shapley–Folkman–Starr theorem," Journal of Mathematical Economics, Elsevier, vol. 114(C).
    18. S. Flåm & L. Koutsougeras, 2010. "Private information, transferable utility, and the core," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(3), pages 591-609, March.
    19. Budish, Eric & Reny, Philip J., 2020. "An improved bound for the Shapley–Folkman theorem," Journal of Mathematical Economics, Elsevier, vol. 89(C), pages 48-52.
    20. Robert M. Anderson & M. Ali Khan & Salim Rashid, 1982. "Approximate Equilibria with Bounds Independent of Preferences," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 49(3), pages 473-475.

    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:aqjoor:v:22:y:2024:i:4:d:10.1007_s10288-024-00566-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.