The min-up/min-down unit commitment polytope

DOI10.1007/s10878-018-0273-yzbMath1414.90141OpenAlexW2794366327MaRDI QIDQ1631659

Pierre Fouilhoux, Pascale Bendotti, Cécile Rottner

Publication date: 6 December 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0273-y

zbMATH Keywords

polytopebranch and cutfacetmin-up/min-downunit commitment problem (UCP)

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Reliability, availability, maintenance, inspection in operations research (90B25) Production models (90B30)

Related Items (10)

The polytope of binary sequences with bounded variation ⋮ Symmetry-breaking inequalities for ILP with structured sub-symmetry ⋮ Bounded variation in binary sequences ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ On the complexity of the unit commitment problem ⋮ Fix-and-optimize procedures for solving the long-term unit commitment problem with pumped storages ⋮ Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services

Cites Work

• Tight MIP formulations of the power-based unit commitment problem
• About Lagrangian methods in integer optimization
• Modified orbital branching for structured symmetry with an application to unit commitment
• Large-scale unit commitment under uncertainty
• Min-up/min-down polytopes
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• Separation algorithms for 0-1 knapsack polytopes
• Facets of the knapsack polytope
• Optimization by decomposition and coordination: A unified approach

This page was built for publication: The min-up/min-down unit commitment polytope