Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/22286
Title: Semi-infinite programming method for optimal power flow with transient stability and variable clearing time of faults
Authors: Tong, X
Ling, C
Wu, SY
Qi, L 
Issue Date: 2013
Source: Journal of global optimization, 2013, v. 55, no. 4, p. 813-830
Abstract: This paper presents a new nonlinear programming problem arising in the control of power systems, called optimal power flow with transient stability constraint and variable clearing time of faults and abbreviated as OTS-VT. The OTS-VT model is converted into a implicit generalized semi-infinite programming (GSIP) problem. According to the special box structure of the reformulated GSIP, a solution method based on bi-level optimization is proposed. The research in this paper has two contributions. Firstly, it generalizes the OTS study to general optimal power flow with transient stability problems. From the viewpoint of practical applications, the proposed research can improve the decision-making ability in power system operations. Secondly, the reformulation of OTS-VT also provides a new background and a type of GSIP in the research of mathematical problems. Numerical results for two chosen power systems show that the methodology presented in this paper is effective and promising.
Keywords: Clearing time of faults
Generalized semi-infinite programming
Nonlinear programming
Optimal power flow with transient stability constraint
Publisher: Springer
Journal: Journal of global optimization 
ISSN: 0925-5001
EISSN: 1573-2916
DOI: 10.1007/s10898-011-9812-0
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Sep 7, 2020

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Sep 17, 2020

Page view(s)

156
Last Week
0
Last month
Citations as of Sep 20, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.