IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4939-1007-6_8.html
   My bibliography  Save this book chapter

Optimal Scheduling of a Multiunit Hydro Power Station in a Short-Term Planning Horizon

In: Case Studies in Operations Research

Author

Listed:
  • Alberto Borghetti

    (University of Bologna)

  • Claudia D’Ambrosio

    (École Polytechnique)

  • Andrea Lodi

    (University of Bologna)

  • Silvano Martello

    (University of Bologna)

Abstract

This chapter deals with the problem of determining the commitment and the power generation of a single-reservoir pump storage hydro power plant. Two MILP models with different levels of complexity are computationally tested and compared with the natural MINLP formulation. In this specific optimization problem, the quality of the approximation provided by the piecewise linear approximation of nonlinear and nonconcave constraints is very effective in order to exploit the performance of MILP solvers.

Suggested Citation

  • Alberto Borghetti & Claudia D’Ambrosio & Andrea Lodi & Silvano Martello, 2015. "Optimal Scheduling of a Multiunit Hydro Power Station in a Short-Term Planning Horizon," International Series in Operations Research & Management Science, in: Katta G. Murty (ed.), Case Studies in Operations Research, edition 127, chapter 8, pages 167-181, Springer.
    • Handle: RePEc:spr:isochp:978-1-4939-1007-6_8
    DOI: 10.1007/978-1-4939-1007-6_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Luca Mencarelli & Youcef Sahraoui & Leo Liberti, 2017. "A multiplicative weights update algorithm for MINLP," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 31-86, March.

    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:isochp:978-1-4939-1007-6_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.

    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.