2016 49th Hawaii International Conference on System Sciences (HICSS) 2016
DOI: 10.1109/hicss.2016.289
|View full text |Cite
|
Sign up to set email alerts
|

Calculation of Voltage Stability Margins and Certification of Power Flow Insolvability Using Second-Order Cone Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 12 publications
(7 citation statements)
references
References 32 publications
0
7
0
Order By: Relevance
“…The best critical global integration of RES into the distribution network is provided by a robust methodology-based Political Optimizer and Objective Function Approach [12]. A second-order cone programming (SOCP) formulation has been studied that directly gives upper limits on voltage stability margin without the need to specify a configuration [13]. For cases like the 59-bus in Cairo and the 83-bus in Taiwan, a probabilistic bilevel multi-objective nonlinear programming optimization problem is formulated to maximize the penetration of RES via distribution network reconfiguration without taking into account its intermittent nature [14].…”
Section: Related Workmentioning
confidence: 99%
“…The best critical global integration of RES into the distribution network is provided by a robust methodology-based Political Optimizer and Objective Function Approach [12]. A second-order cone programming (SOCP) formulation has been studied that directly gives upper limits on voltage stability margin without the need to specify a configuration [13]. For cases like the 59-bus in Cairo and the 83-bus in Taiwan, a probabilistic bilevel multi-objective nonlinear programming optimization problem is formulated to maximize the penetration of RES via distribution network reconfiguration without taking into account its intermittent nature [14].…”
Section: Related Workmentioning
confidence: 99%
“…The OPF problem determines a minimum cost operating point for an electric power system subject to both network constraints (i.e., the power flow equations) and engineering limits (e.g., bounds on voltage magnitudes, active and reactive power injections, and line flows). This section presents the MSOS relaxations in terms of the OPF problem; however, note that the MSOS formulations could be applied to a variety of other power system optimization problems (e.g., transmission expansion planning [65], [66], voltage regulation [67], state estimation [68], and calculating voltage stability margins [12]- [14]). Further, when applied to an optimization problem with a feasible space defined by polynomial equality constraints and a constant objective function, MSOS relaxations with sufficiently high relaxation order can find all solutions to the polynomials [41].…”
Section: Moment/sum-of-squares Relaxations Of the Power Flow Equationsmentioning
confidence: 99%
“…After identifying such a region, any solution contained within can be quickly calculated. Convex relaxation techniques can also calculate power flow solutions [11] and certify infeasibility [12]- [14]. Additionally, progress has been made using "decoupling" approximations that facilitate separate analysis of the active and reactive power flow equations [15], [16].…”
Section: Introductionmentioning
confidence: 99%
“…Although continuation methods [4], [5] are mature technology for solving ML, they are not directly applicable to MLD and rely on proper initialization [6], [7]. The optimization methods, however, offer higher modeling flexibility at a higher computational cost [1], [7].…”
Section: Introductionmentioning
confidence: 99%