1983
DOI: 10.1109/mper.1983.5518953
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Security Dispatch: Basic Formulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2005
2005
2007
2007

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 0 publications
0
5
0
Order By: Relevance
“…To derive the formulas for evaluating gradient of the stability performance index with respect to , Lagrange multiplier vectors and are introduced to construct a new functional as follows [25]: (13) where , which emphasizes that at time , is a function of state variable . Considering (1) and (2), it is easy to see that the following holds true: (14) Using the formula of integration by parts, the following can be derived:…”
Section: Appendix a Sensitivity Formulation For The Stability Performmentioning
confidence: 99%
See 2 more Smart Citations
“…To derive the formulas for evaluating gradient of the stability performance index with respect to , Lagrange multiplier vectors and are introduced to construct a new functional as follows [25]: (13) where , which emphasizes that at time , is a function of state variable . Considering (1) and (2), it is easy to see that the following holds true: (14) Using the formula of integration by parts, the following can be derived:…”
Section: Appendix a Sensitivity Formulation For The Stability Performmentioning
confidence: 99%
“…In [13], the most severe contingency is recursively dealt with until all contingencies become stable. System security constraints have been gradually incorporated in studies of economic dispatch [14], [15], optimal power flow [16]- [20], and optimal operation [21]. Reference [14] presents a dynamic optimal dispatch method considering both economy and security of system operations.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Besides, y in (4) is a variable while in (3) it is an exogenously defined Downloaded by [University of Chicago Library] at 12:06 26 December 2014 parameter. In general, it is very difficult to find a numerical solution for a bi-level optimization problem because bi-level problems are of combinatorial nature [7]. Fortunately, the lower-level optimization problem (20) in (4) has a very simple structure that can be exploited.…”
Section: A Direct Search Algorithm For Rotor Angle Limit Y; Problem (4)mentioning
confidence: 99%
“…In general, the stability boundary of a smooth dynamic system is composed of trajectories [5,6], which are very difficult to find. To overcome this difficulty, several alternative solution concepts have been suggested in [3,4,[7][8][9][10][11][12][13][14][15][16], and the references cited therein.…”
Section: Introductionmentioning
confidence: 99%