2022 article
A Polynomial-Time Algorithm with Tight Error Bounds for Single-Period Unit Commitment Problem
Gao, R.-T., Fang, S.-C., Lu, C., & Xing, W.-X. (2022, January 28). JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA.
author keywords: Nonlinear programming; Lagrangian dual; Unit commitment problem; Mixed-integer quadratic programming; Convex relaxation
TL;DR:
Tight theoretical bounds for the absolute errors and relative errors of the approximate solutions generated by the proposed Lagrangian dual-based polynomial-time approximation algorithm for solving the single-period unit commitment problem are provided.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy
(Web of Science)
Source: Web Of Science
Added: February 7, 2022