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

DOI10.1007/S13675-016-0066-YMaRDI QIDQ2397763zbMATH OpenOpenAlexFDO

Authors 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)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

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

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

Cites work

• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 6108474 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• A polyhedral study of production ramping
• 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
• Tight MIP formulations of the power-based unit commitment problem

Cited in

(19)

• Tight MIP formulations of the power-based unit commitment problem
• On Mixed-Integer Programming Formulations for the Unit Commitment Problem
• Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
• Cutting planes for the multistage stochastic unit commitment problem
• New mixed-integer nonlinear programming formulations for the unit commitment problems with ramping constraints
• Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints
• Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
• The min-up/min-down unit commitment polytope
• Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
• On the complexity of the unit commitment problem
• Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets
• Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints
• Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
• The summed start-up costs in a unit commitment problem
• A strengthened mixed-integer linear programming formulation for combined-cycle units
• A Polyhedral Study on Fuel-Constrained Unit Commitment
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• Tight MIP formulations for bounded up/down times and interval-dependent start-ups
• Multistage stochastic power generation scheduling co-optimizing energy and ancillary services

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)