IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v17y2024i19p4851-d1487165.html
   My bibliography  Save this article

Convex Hull Pricing for Unit Commitment: Survey, Insights, and Discussions

Author

Listed:
  • Farhan Hyder

    (Department of Electrical and Microelectronic Engineering, Rochester Institute of Technology, Rochester, NY 14623, USA)

  • Bing Yan

    (Department of Electrical and Microelectronic Engineering, Rochester Institute of Technology, Rochester, NY 14623, USA)

  • Mikhail Bragin

    (Department of Electrical and Computer Engineering, University of Connecticut, Storrs, CT 06269, USA)

  • Peter Luh

    (Department of Electrical and Computer Engineering, University of Connecticut, Storrs, CT 06269, USA
    Dr. P. B. Luh, a co-supervisor of this project, sadly passed away in November 2022. He was a professor emeritus in the Department of Electrical and Computer Engineering at the University of Connecticut, Storrs, CT, USA, and also affiliated with the Department of Electrical Engineering at National Taiwan University, Taipei, Taiwan. In honor of our esteemed colleague and mentor, we, the co-authors, dedicate this paper to commemorating Dr. Luh’s remarkable contributions and enduring legacy.)

Abstract

Energy prices are usually determined by the marginal costs obtained by solving economic dispatch problems without considering commitment costs. Hence, generating units are compensated through uplift payments. However, uplift payments may undermine market transparency as they are not publicly disclosed. Alternatively, energy prices can be obtained from the unit commitment problem which considers commitment costs. But, due to non-convexity, prices may not monotonically increase with demand. To resolve this issue, convex hull pricing has been introduced. It is defined as the slope of the convex envelope of the total cost function over the convex hull of a unit commitment (UC) problem. Although several approaches have been developed, a relevant survey has not been found to aid the understanding of convex hull pricing from the current limited literature. This paper provides a systematic survey of convex hull pricing. It reviews, compares, and links various existing approaches, focusing on the modeling and computation of convex hull prices. Furthermore, this paper explores potential areas of improvement and future challenges due to the ongoing efforts for power system decarbonization.

Suggested Citation

  • Farhan Hyder & Bing Yan & Mikhail Bragin & Peter Luh, 2024. "Convex Hull Pricing for Unit Commitment: Survey, Insights, and Discussions," Energies, MDPI, vol. 17(19), pages 1-20, September.
    • Handle: RePEc:gam:jeners:v:17:y:2024:i:19:p:4851-:d:1487165
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/17/19/4851/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1996-1073/17/19/4851/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yongpei Guan & Kai Pan & Kezhuo Zhou, 2018. "Polynomial time algorithms and extended formulations for unit commitment problems," IISE Transactions, Taylor & Francis Journals, vol. 50(8), pages 735-751, August.
    2. Mikhail A. Bragin & Peter B. Luh & Joseph H. Yan & Nanpeng Yu & Gary A. Stern, 2015. "Convergence of the Surrogate Lagrangian Relaxation Method," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 173-201, January.
    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. Skolfield, J. Kyle & Escobedo, Adolfo R., 2022. "Operations research in optimal power flow: A guide to recent and emerging methodologies and applications," European Journal of Operational Research, Elsevier, vol. 300(2), pages 387-404.
    2. Heng Yang & Ziliang Jin & Jianhua Wang & Yong Zhao & Hejia Wang & Weihua Xiao, 2019. "Data-Driven Stochastic Scheduling for Energy Integrated Systems," Energies, MDPI, vol. 12(12), pages 1-21, June.
    3. Kai Pan & Ming Zhao & Chung-Lun Li & Feng Qiu, 2022. "A Polyhedral Study on Fuel-Constrained Unit Commitment," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3309-3324, November.
    4. Azadian, Farshid & Murat, Alper & Chinnam, Ratna Babu, 2015. "Integrated production and logistics planning: Contract manufacturing and choice of air/surface transportation," European Journal of Operational Research, Elsevier, vol. 247(1), pages 113-123.
    5. Jianqiu Huang & Kai Pan & Yongpei Guan, 2021. "Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 352-369, January.
    6. Bernard Knueven & James Ostrowski & Jean-Paul Watson, 2020. "On Mixed-Integer Programming Formulations for the Unit Commitment Problem," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 857-876, October.
    7. Wang, Tingsong & Xing, Zheng & Hu, Hongtao & Qu, Xiaobo, 2019. "Overbooking and delivery-delay-allowed strategies for container slot allocation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 433-447.
    8. Monique Guignard, 2020. "Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0–1 optimization problems with linear constraints," Annals of Operations Research, Springer, vol. 286(1), pages 173-200, March.
    9. Wang, Tingsong & Meng, Qiang & Wang, Shuaian & Qu, Xiaobo, 2021. "A two-stage stochastic nonlinear integer-programming model for slot allocation of a liner container shipping service," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 143-160.

    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:gam:jeners:v:17:y:2024:i:19:p:4851-:d:1487165. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.