Fast computation of global solutions to the single-period unit commitment problem

DOI10.1007/s10878-019-00489-9zbMath1501.90053OpenAlexW2991213216MaRDI QIDQ2082175

Shu-Cherng Fang, Cheng Lu, Wen-Xun Xing, Zhi-bin Deng, Qing-Wei Jin

Publication date: 4 October 2022

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

Full work available at URL: https://doi.org/10.1007/s10878-019-00489-9

zbMATH Keywords

branch-and-bound algorithmquadratic programmingmixed integer pogramming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items (2)

A polynomial-time algorithm with tight error bounds for single-period unit commitment problem ⋮ A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters

Uses Software

• CPLEX
• Gurobi
• MATPOWER

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient market-clearing prices in markets with nonconvexities
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
• New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
• Critical Review of Pricing Schemes in Markets with Non-Convex Costs
• Multistage Adaptive Robust Optimization for the Unit Commitment Problem
• Optimal Hour-Ahead Bidding in the Real-Time Electricity Market with Battery Storage Using Approximate Dynamic Programming
• Mathematical Programming and Economic Theory
• Algorithm for the N-2 Security-Constrained Unit Commitment Problem with Transmission Switching

This page was built for publication: Fast computation of global solutions to the single-period unit commitment problem