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.

By: R. Gao*, S. Fang n , C. Lu * & W. Xing*

author keywords: Nonlinear programming; Lagrangian dual; Unit commitment problem; Mixed-integer quadratic programming; Convex relaxation
topics (OpenAlex): Electric Power System Optimization; Optimization and Search Problems; Scheduling and Optimization Algorithms
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 Goals Color Wheel
UN Sustainable Development Goal Categories
Source: Web Of Science
Added: February 7, 2022