Tight MIP formulations of the power-based unit commitment problem

DOI10.1007/s00291-015-0400-4zbMath1326.90034OpenAlexW1504470287WikidataQ59403034 ScholiaQ59403034MaRDI QIDQ747751

Andres Ramos, Germán Morales-España, Claudio Gentile

Publication date: 19 October 2015

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-015-0400-4

zbMATH Keywords

convex hullmixed integer programmingunit commitmentquick-start unitsslow-start unitstight formulation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic scheduling theory in operations research (90B36) Economic models of real-world systems (e.g., electricity markets, etc.) (91B74)

Related Items (10)

Tight MIP formulations for bounded up/down times and interval-dependent start-ups ⋮ The min-up/min-down unit commitment polytope ⋮ Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints ⋮ A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints ⋮ Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints ⋮ The Ramping Polytope and Cut Generation for the Unit Commitment Problem ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ On the complexity of the unit commitment problem ⋮ Quantitative solutions for future energy systems and markets ⋮ Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems

Cites Work

• Unnamed Item
• Unnamed Item
• A polyhedral study of production ramping
• Large-scale unit commitment under uncertainty
• Min-up/min-down polytopes
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints

This page was built for publication: Tight MIP formulations of the power-based unit commitment problem