Tight MIP formulations of the power-based unit commitment problem

DOI10.1007/s00291-015-0400-4zbMath1326.90034WikidataQ59403034 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 hull; mixed integer programming; unit commitment; quick-start units; slow-start units; tight formulation

Mathematics Subject Classification ID

90C11: Mixed integer programming

90B36: Stochastic scheduling theory in operations research

91B74: Economic models of real-world systems (e.g., electricity markets, etc.)

Related Items

Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems, The Ramping Polytope and Cut Generation for the Unit Commitment Problem, Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints, The min-up/min-down unit commitment polytope, 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, Tight MIP formulations for bounded up/down times and interval-dependent start-ups, 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

Cites Work

• 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
• Unnamed Item
• Unnamed Item