Semidefinite programming solution of economic dispatch problem with non smooth, non-convex cost functions

被引：32

作者：

Alawode, K. O. ^{[1
]}

Jubril, A. M. ^{[2
]}

Kehinde, L. O. ^{[2
]}

Ogunbona, P. O. ^{[3
]}

机构：

[1] Osun State Univ, Dept Elect & Elect Engn, Osogbo, Nigeria

[2] Obafemi Awolowo Univ, Dept Elect & Elect Engn, Ife, Nigeria

[3] Univ Wollongong, Sch Comp & Informat Technol, Wollongong, NSW, Australia

来源：

ELECTRIC POWER SYSTEMS RESEARCH | 2018年 / 164卷

关键词：

Economic dispatch; Semidefinite programming; Non-convex; Non-smooth cost function; Convex iteration; Branch-and-bound; OPTIMAL POWER-FLOW; PROHIBITED OPERATING ZONES; GROUP SEARCH OPTIMIZER; LOAD DISPATCH; GENETIC ALGORITHM; ELECTRICITY DISPATCH; NEURAL-NETWORK; NONSMOOTH; HYBRID; UNITS;

D O I：

10.1016/j.epsr.2018.07.026

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The paper presents a solution to economic dispatch (ED) problems with non-convex, non-smooth fuel cost functions, which characterize practical generating units. A method involving a unified semidefmite programming (SDP) formulation of different ED problems through cost function decomposition was presented. The solution of the resulting rank-relaxed SDP problem was refined to achieve the rank constraint using the method of convex iteration and branch-and-bound technique. The SDP method was investigated on some test problems in the literature. The results showed that the SDP method compared favorably with other methods, and can efficiently solve non-convex and non-smooth ED problems.

引用

页码：178 / 187

页数：10

共 55 条

[1]

[Anonymous], 2004, CINEMA AESTHETICS SU

[2]

[Anonymous], 2013, Power Generation, Operation and Control

[3]

[Anonymous], 2016, CVX MATLAB SOFTWARE

[4]

[Anonymous], 2004, P IEEE INT S COMPUTE