A convex quadratic programming model for unit commitment global optimization-Reference-Cited by-同舟云学术

A convex quadratic programming model for unit commitment global optimization

Published:2017-12-21 Issue:3 Volume:13 Page:417-431
ISSN:1931-4973
Container-title:IEEJ Transactions on Electrical and Electronic Engineering
language:en
Short-container-title:IEEJ Trans Elec Electron Eng

Author:

Hou Wenting¹,Wei Hua¹,Tan Jiancheng¹,Lin Chunmei¹

Affiliation:

1. Guangxi Key Laboratory of Power System Optimization and Energy Technology; Guangxi University; Nanning 530004 Guangxi Zhuang Autonomous Region China

Funder

National Natural Science Foundation of China

National Key Basic Research Program of China

Publisher

Wiley

Subject

Electrical and Electronic Engineering

Reference32 articles.

1. Unit commitment by Lagrangian relaxation and genetic algorithms;Cheng;IEEE Transactions on Power Systems,2000

2. Semi-definite programming-based method for security-constrained unit commitment with operational and optimal power flow constraints;Bai;IET Generation Transmission & Distribution,2009

3. A genetic algorithm solution to the unit commitment problem;Kazarlis;IEEE Transactions on Power Systems,1996

4. A branch-and-bound algorithm for unit commitment;Cohen;IEEE Transactions on Power Apparatus & Systems,1983

5. A fast technique for unit commitment problem by extended priority list;Senjyu;IEEE Transactions on Power Systems,2003

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sensitivity analysis of the unit commitment problem to guide data acquisition investments in a small island developing state: A case study;Results in Engineering;2023-06

2. Enhanced Lagrange relaxation for the optimal unit commitment of identical generating units;IET Generation, Transmission & Distribution;2020-07-09

3. DLMPCS‐based improved yaw stability control strategy for DDEV;IET Intelligent Transport Systems;2019-05-20