IDEAS home Printed from https://ideas.repec.org/a/spr/eurjco/v5y2017i1d10.1007_s13675-016-0062-2.html
   My bibliography  Save this article

The summed start-up costs in a unit commitment problem

Author

Listed:
  • René Brandenberg

    (Technische Universität München)

  • Matthias Huber

    (Technische Universität München)

  • Matthias Silbernagl

    (Technische Universität München)

Abstract

We consider the sum of the incurred start-up costs of a single unit in a Unit Commitment problem. Our major result is a correspondence between the facets of its epigraph and some binary trees for concave start-up cost functions CU, which is bijective if CU is strictly concave. We derive an exponential $${\mathcal{H}}$$ H -representation of this epigraph, and provide an exact linear separation algorithm. These results significantly reduce the integrality gap of the Mixed Integer formulation of a Unit Commitment Problem compared to current literature.

Suggested Citation

  • René Brandenberg & Matthias Huber & Matthias Silbernagl, 2017. "The summed start-up costs in a unit commitment problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 203-238, March.
    • Handle: RePEc:spr:eurjco:v:5:y:2017:i:1:d:10.1007_s13675-016-0062-2
    DOI: 10.1007/s13675-016-0062-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13675-016-0062-2
    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/s13675-016-0062-2?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. Matthias Nowak & Werner Römisch, 2000. "Stochastic Lagrangian Relaxation Applied to Power Scheduling in a Hydro-Thermal System under Uncertainty," Annals of Operations Research, Springer, vol. 100(1), pages 251-272, December.
    2. George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
    3. Jonas Egerer & Clemens Gerbaulet & Richard Ihlenburg & Friedrich Kunz & Benjamin Reinhard & Christian von Hirschhausen & Alexander Weber & Jens Weibezahn, 2014. "Electricity Sector Data for Policy-Relevant Modeling: Data Documentation and Applications to the German and European Electricity Markets," Data Documentation 72, DIW Berlin, German Institute for Economic Research.
    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. Luis Montero & Antonio Bello & Javier Reneses, 2022. "A Review on the Unit Commitment Problem: Approaches, Techniques, and Resolution Methods," Energies, MDPI, vol. 15(4), pages 1-40, February.
    2. 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.

    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. A. Ruszczynski, 1993. "Regularized Decomposition of Stochastic Programs: Algorithmic Techniques and Numerical Results," Working Papers wp93021, International Institute for Applied Systems Analysis.
    2. Ethem Çanakoğlu & İbrahim Muter & Tevfik Aytekin, 2021. "Integrating Individual and Aggregate Diversity in Top- N Recommendation," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 300-318, January.
    3. Ogbe, Emmanuel & Li, Xiang, 2017. "A new cross decomposition method for stochastic mixed-integer linear programming," European Journal of Operational Research, Elsevier, vol. 256(2), pages 487-499.
    4. Sankaran, Jayaram K., 1995. "Column generation applied to linear programs in course registration," European Journal of Operational Research, Elsevier, vol. 87(2), pages 328-342, December.
    5. Metrane, Abdelmoutalib & Soumis, François & Elhallaoui, Issmail, 2010. "Column generation decomposition with the degenerate constraints in the subproblem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 37-44, November.
    6. Belanger, Nicolas & Desaulniers, Guy & Soumis, Francois & Desrosiers, Jacques, 2006. "Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1754-1766, December.
    7. Williams, R. Lynn & Dillion, Carl R. & McCarl, Bruce A., 1992. "An Economic Investigation of Edwards Aquifer Water Use Tradeoffs," WAEA/ WFEA Conference Archive (1929-1995) 321395, Western Agricultural Economics Association.
    8. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
    9. Luis Montero & Antonio Bello & Javier Reneses, 2022. "A Review on the Unit Commitment Problem: Approaches, Techniques, and Resolution Methods," Energies, MDPI, vol. 15(4), pages 1-40, February.
    10. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    11. Melanie Erhard, 2021. "Flexible staffing of physicians with column generation," Flexible Services and Manufacturing Journal, Springer, vol. 33(1), pages 212-252, March.
    12. Thomas W. M. Vossen & Dan Zhang, 2015. "Reductions of Approximate Linear Programs for Network Revenue Management," Operations Research, INFORMS, vol. 63(6), pages 1352-1371, December.
    13. Ternoy, Jacques Emmanuel, 1969. "Cooperation and economic efficiency," ISU General Staff Papers 196901010800004786, Iowa State University, Department of Economics.
    14. Kunz, Friedrich & Neuhoff, Karsten & Rosellón, Juan, 2016. "FTR allocations to ease transition to nodal pricing: An application to the German power system," Energy Economics, Elsevier, vol. 60(C), pages 176-185.
    15. Ibrahim Muter & Tevfik Aytekin, 2017. "Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 405-421, August.
    16. Han, Jialin & Zhang, Jiaxiang & Guo, Haoyue & Zhang, Ning, 2024. "Optimizing location-routing and demand allocation in the household waste collection system using a branch-and-price algorithm," European Journal of Operational Research, Elsevier, vol. 316(3), pages 958-975.
    17. Canca, David & Barrena, Eva, 2018. "The integrated rolling stock circulation and depot location problem in railway rapid transit systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 115-138.
    18. Jan Abrell & Sebastian Rausch & Clemens Streitberger, 2022. "The Economic and Climate Value of Flexibility in Green Energy Markets," Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 83(2), pages 289-312, October.
    19. Wilko Heitkoetter & Wided Medjroubi & Thomas Vogt & Carsten Agert, 2019. "Comparison of Open Source Power Grid Models—Combining a Mathematical, Visual and Electrical Analysis in an Open Source Tool," Energies, MDPI, vol. 12(24), pages 1-15, December.
    20. Hongling, Liu & Chuanwen, Jiang & Yan, Zhang, 2008. "A review on risk-constrained hydropower scheduling in deregulated power market," Renewable and Sustainable Energy Reviews, Elsevier, vol. 12(5), pages 1465-1475, June.

    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:eurjco:v:5:y:2017:i:1:d:10.1007_s13675-016-0062-2. 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.