1993
DOI: 10.1007/bf02024843
|View full text |Cite
|
Sign up to set email alerts
|

ORION, minimizing reactive compensation on the electricity transmission system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2011
2011
2012
2012

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 3 publications
0
5
0
Order By: Relevance
“…This creates an enormous optimization problem. A VAr planning solution for each system state can be obtained via an OPF program, an example of which is Optimization of Reactive compensation Installed On the Network (ORION) [17]. What is required is to be able to optimize the compensation over all credible system states so that the cooperative effect of VAr installations for the different states is leveraged, thus allowing the computation of a truly minimum solution.…”
Section: Motivation: Multiple State Optimizationmentioning
confidence: 99%
See 1 more Smart Citation
“…This creates an enormous optimization problem. A VAr planning solution for each system state can be obtained via an OPF program, an example of which is Optimization of Reactive compensation Installed On the Network (ORION) [17]. What is required is to be able to optimize the compensation over all credible system states so that the cooperative effect of VAr installations for the different states is leveraged, thus allowing the computation of a truly minimum solution.…”
Section: Motivation: Multiple State Optimizationmentioning
confidence: 99%
“…Han and Mangasarian [24] also give a value for : Under the second-order sufficiency conditions, the above theorem is valid for , where is a Kuhn-Tucker point of problem (17). With the above conditions, Fletcher [25] demonstrates the converse: If solves (18) and is feasible to (17), then solves (17). In practice, the conditions under which equivalence holds are usually satisfied [25].…”
Section: A Theoretical Backgroundmentioning
confidence: 99%
“…More systematic solution methods that are based on optimization techniques have since been developed. These techniques include different variations of successive linear programming (SLP) [1][2][3] and successive quadratic programming (SQP) [4]; however, integer variables, which are desirable to model discrete sizes and fixed costs, were not handled in [1][2][3][4]. An approach that is capable of handling such variables is Bender's decomposition [5].…”
Section: Introductionmentioning
confidence: 99%
“…Unlike the AI/hybrid methods [9][10][11][12][13][14][15], which are limited to a single network configuration, both the hybrid window schema simulated annealing approach in [16] and the evolutionary particle swarm optimization in [17] consider contingency cases; testing was, however, demonstrated on a single contingency case. References [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17] were concerned with correcting the voltage profile and did not include constraints on voltage stability. Reactive power planning formulations that guard against voltage collapse were more recently proposed in [18][19][20][21][22].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation