1999
DOI: 10.1109/59.744492
|View full text |Cite
|
Sign up to set email alerts
|

A review of selected optimal power flow literature to 1993. I. Nonlinear and quadratic programming approaches

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
314
0
14

Year Published

2008
2008
2019
2019

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 740 publications
(355 citation statements)
references
References 25 publications
0
314
0
14
Order By: Relevance
“…In order to solve this problem mathematically, various optimization algorithms that have been developed so far could be applied in principle, since the existing technologies for data communication and acquisition render the coordinated management as a feasible task. However the classical optimization algorithms, such as gradient-based algorithms, described in [8]- [10], struggle with non-linearity and nonconvexity of the problem, which is also characterized by discontinue and multimodal landscape [11]. Conclusively, the classical optimization tools are not flexible to be applied in a complex search space and are sensitive to the initial points as well [12].…”
Section: Introductionmentioning
confidence: 99%
“…In order to solve this problem mathematically, various optimization algorithms that have been developed so far could be applied in principle, since the existing technologies for data communication and acquisition render the coordinated management as a feasible task. However the classical optimization algorithms, such as gradient-based algorithms, described in [8]- [10], struggle with non-linearity and nonconvexity of the problem, which is also characterized by discontinue and multimodal landscape [11]. Conclusively, the classical optimization tools are not flexible to be applied in a complex search space and are sensitive to the initial points as well [12].…”
Section: Introductionmentioning
confidence: 99%
“…A survey of the approaches for solving the OPF prior to 2008 are provided in [10], [11], [12]. Recently there has been an effort at obtaining globally optimal solutions to the nonconvex problems through second order cone programming (SOCP) and SDP relaxations.…”
Section: A Literature Surverymentioning
confidence: 99%
“…However, the problem becomes very challenging when the problem cannot be formulated as convex programming. In calculating the optimal power flow (OPF) (Wood and Wollenburg (1996), Huneault and Galiana (1991), Momoh et al (1999), Momoh (2009), Frank et al (2012), Zhu (2015), Taylor (2015)), because the flow equation is described as a nonlinear equality constraint, the problem becomes one of nonlinear optimization with a feasible set that is not convex. In this case, a feasible solution may not be obtainable.…”
Section: Introductionmentioning
confidence: 99%