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

DOI10.1007/S13675-016-0066-YzbMATH Open1368.90113OpenAlexW2143571768MaRDI QIDQ2397763FDOQ2397763

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

Recommendations

• Tight MIP formulations of the power-based unit commitment problem
• Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints
• Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints
• Cutting planes for the multistage stochastic unit commitment problem
• The min-up/min-down unit commitment polytope

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Large-scale unit commitment under uncertainty
• Title not available (Why is that?)
• Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
• Title not available (Why is that?)
• A polyhedral study of production ramping
• Title not available (Why is that?)
• Min-up/min-down polytopes
• Tight MIP formulations of the power-based unit commitment problem
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem

Cited In (11)

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

This page was built for publication: A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397763)