A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints

DOI10.1007/s13675-016-0066-yzbMath1368.90113OpenAlexW2143571768MaRDI QIDQ2397763

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

Publication date: 23 May 2017

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-016-0066-y

zbMATH Keywords

mixed-integer programming (MIP)facet/convex hull descriptionunit commitment (UC)

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, The min-up/min-down unit commitment polytope, A Polyhedral Study on Fuel-Constrained Unit Commitment, Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets, Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints, The Ramping Polytope and Cut Generation for the Unit Commitment Problem, On the complexity of the unit commitment problem, On Mixed-Integer Programming Formulations for the Unit Commitment Problem, Tight MIP formulations of the power-based unit commitment problem, Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services, Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polyhedral study of production ramping
• Tight MIP formulations of the power-based unit commitment problem
• Large-scale unit commitment under uncertainty
• Min-up/min-down polytopes
• Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem