Tight MIP formulations of the power-based unit commitment problem

DOI10.1007/S00291-015-0400-4zbMATH Open1326.90034OpenAlexW1504470287WikidataQ59403034 ScholiaQ59403034MaRDI QIDQ747751FDOQ747751

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

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

Recommendations

• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• 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
• Unit commitment in power generation -- a basic model and some extensions

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Large-scale unit commitment under uncertainty
• 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
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints

Cited In (17)

• Profit-based unit commitment models with price-responsive decision-dependent uncertainty
• Title not available (Why is that?)
• Large-scale unit commitment under uncertainty: an updated literature survey
• Tight MIP formulations for bounded up/down times and interval-dependent start-ups
• Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
• The min-up/min-down unit commitment polytope
• Optimal unit commitment by branch-and-bound exploiting dual optimization conditions
• A deterministic method for the unit commitment problem in power systems
• Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints
• Optimal Control Formulations for the Unit Commitment Problem
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• Quantitative solutions for future energy systems and markets
• On the complexity of the unit commitment problem
• Algorithm for the N-2 Security-Constrained Unit Commitment Problem with Transmission Switching
• Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints

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

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