Tight MIP formulations of the power-based unit commitment problem

DOI10.1007/S00291-015-0400-4MaRDI QIDQ747751zbMATH OpenOpenAlexWikidataFDO

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

Publication date 19 October 2015

Published in OR Spectrum (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

convex hullmixed integer programmingquick-start unitsslow-start unitstight formulationunit commitment

Mathematics Subject Classification ID

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

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

Cites work

• A polyhedral study of production ramping
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 6108474 (Why is no real title available?)
• Large-scale unit commitment under uncertainty
• Min-up/min-down polytopes
• Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints

Cited in

(26)

• The min-up/min-down unit commitment polytope
• A strengthened mixed-integer linear programming formulation for combined-cycle units
• 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
• Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints
• An extended formulation for two-stage stochastic unit commitment with reserves
• Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
• 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
• The summed start-up costs in a unit commitment problem
• The unit commitment model with concave emissions costs: a hybrid Benders' decomposition with nonconvex master problems
• Optimal unit commitment by branch-and-bound exploiting dual optimization conditions
• Cutting planes for the multistage stochastic unit commitment problem
• A deterministic method for the unit commitment problem in power systems
• scientific article; zbMATH DE number 978508 (Why is no real title available?)
• Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
• Algorithm for the N-2 Security-Constrained Unit Commitment Problem with Transmission Switching
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• On Mixed-Integer Programming Formulations for the Unit Commitment Problem
• Optimal Control Formulations for the Unit Commitment Problem
• Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
• Profit-based unit commitment models with price-responsive decision-dependent uncertainty
• New mixed-integer nonlinear programming formulations for the unit commitment problems with ramping constraints
• Enhancing matheuristics for a thermal unit commitment problem through kernel search and local branching

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)