The min-up/min-down unit commitment polytope

DOI10.1007/S10878-018-0273-YMaRDI QIDQ1631659zbMATH OpenOpenAlexWikidataFDO

Authors Pascale Bendotti, Pierre Fouilhoux, 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

polytopefacetbranch and cutmin-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)

Recommendations

• Cutting planes for the multistage stochastic unit commitment problem
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• Min-up/min-down polytopes
• A polyhedral study of production ramping
• Tight MIP formulations of the power-based unit commitment problem

Cites work

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

Cited in

(17)

• Large-scale unit commitment under uncertainty: an updated literature survey
• Fix-and-optimize procedures for solving the long-term unit commitment problem with pumped storages
• 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 summed start-up costs in a unit commitment problem
• Cutting planes for the multistage stochastic unit commitment problem
• A polyhedral study of production ramping
• The polytope of binary sequences with bounded variation
• Bounded variation in binary sequences
• Multistage stochastic power generation scheduling co-optimizing energy and ancillary services
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• Min-up/min-down polytopes
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• Symmetry-breaking inequalities for ILP with structured sub-symmetry
• On the complexity of the unit commitment problem
• scientific article; zbMATH DE number 7525448 (Why is no real title available?)
• scientific article; zbMATH DE number 7561666 (Why is no real title available?)

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

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