On the complexity of the unit commitment problem

DOI10.1007/S10479-018-2827-XMaRDI QIDQ1730706zbMATH OpenOpenAlexWikidataFDO

Authors Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner

Publication date 6 March 2019

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-018-2827-x

zbMATH Keywords

complexitydynamic programmingsubproblem of decomposition schemeunit commitment problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• The min-up/min-down unit commitment polytope
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• Recent progress in modeling unit commitment problems
• Tight MIP formulations of the power-based unit commitment problem
• Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints

Cites work

• A primal-proximal heuristic applied to the French unit-commitment problem
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• About Lagrangian methods in integer optimization
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Optimization by decomposition and coordination: A unified approach
• Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation
• Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
• The min-up/min-down unit commitment polytope
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• Tight MIP formulations of the power-based unit commitment problem

Cited in

(16)

• Unit commitment in power generation -- a basic model and some extensions
• The complexity of the unit stop number problem and its implications to other related problems
• A long-term unit commitment problem with hydrothermal coordination for economic and emission control in large-scale electricity systems
• Symmetry-breaking inequalities for ILP with structured sub-symmetry
• Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
• A polynomial-time algorithm with tight error bounds for single-period unit commitment problem
• Tractability frontiers of the partner units configuration problem
• A deterministic method for the unit commitment problem in power systems
• scientific article; zbMATH DE number 1560336 (Why is no real title available?)
• Algorithm for the N-2 Security-Constrained Unit Commitment Problem with Transmission Switching
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• Robust unit commitment with n-1 security criteria
• On computational complexity of the electric power flow optimization problem in market environment
• Machine learning-enhanced vector ordinal optimization for multi-objective stochastic unit commitment
• Enhancing matheuristics for a thermal unit commitment problem through kernel search and local branching
• An efficient two-stage column generation algorithm for solving large-scale unit commitment

This page was built for publication: On the complexity of the unit commitment problem

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