A polynomial-time algorithm with tight error bounds for single-period unit commitment problem

DOI10.1007/s40305-021-00376-3OpenAlexW4210516117MaRDI QIDQ2687676

Shu-Cherng Fang, Ruotian Gao, Cheng Lu, Wen-Xun Xing

Publication date: 7 March 2023

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-021-00376-3

zbMATH Keywords

nonlinear programmingconvex relaxationunit commitment problemmixed-integer quadratic programmingLagrangian dual

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Approximated perspective relaxations: a project and lift approach
• A floating-point genetic algorithm for solving the unit commitment problem
• A variant of the dynamic programming algorithm for unit commitment of combined heat and power systems
• A new cross decomposition method for stochastic mixed-integer linear programming
• A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems
• Fast computation of global solutions to the single-period unit commitment problem
• Large-scale unit commitment under uncertainty
• Two-stage network constrained robust unit commitment problem
• A Lagrangian decomposition approach for the pump scheduling problem in water networks
• Multiarea Stochastic Unit Commitment for High Wind Penetration in a Transmission Constrained Network
• Projected Perspective Reformulations with Applications in Design Problems
• Valid Linear Inequalities for Fixed Charge Problems
• Stochastic Lagrangian relaxation applied to power scheduling in a hydro-thermal system under uncertainty