2019
DOI: 10.1109/tpwrs.2018.2878009
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Linearizations of Power Systems With Uncertain Supply and Demand

Abstract: Linearized models of power systems are often desirable to formulate tractable control and optimization problems that still reflect real-world physics adequately under various operating conditions. In this paper, we propose an approach that can make use of known data concerning the distribution of demand, and/or intermittent supply, to minimize expected model inconsistency with respect to the original non-linear model. The optimal linearization is obtained by approximating a generalized moment problem with a hi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 21 publications
0
3
0
Order By: Relevance
“…The infinite-dimensional GMP (4) can be approximated by an SDP relaxation involving a finite number of moments of µ [17]. GMPs with constraints on certain marginal distributions have been approximated using SDP relaxations in the literature for other purposes [19,23], and the derivation in this section leading to (9) and (11) is closely related to these. There is a trade-off between the accuracy of the approximation and the computational cost involved, and this is controlled by the choice of relaxation degree k ∈ N. The lowest admissible degree is determined by the degrees of the polynomial functions defining the problem.…”
Section: Tractable Relaxation Of Gmpmentioning
confidence: 99%
“…The infinite-dimensional GMP (4) can be approximated by an SDP relaxation involving a finite number of moments of µ [17]. GMPs with constraints on certain marginal distributions have been approximated using SDP relaxations in the literature for other purposes [19,23], and the derivation in this section leading to (9) and (11) is closely related to these. There is a trade-off between the accuracy of the approximation and the computational cost involved, and this is controlled by the choice of relaxation degree k ∈ N. The lowest admissible degree is determined by the degrees of the polynomial functions defining the problem.…”
Section: Tractable Relaxation Of Gmpmentioning
confidence: 99%
“…In [21], the authors apply Taylor approximations to linearize the AC OPF. Another linearization approach is proposed in [22], using prior knowledge on the statistics of the demand. Finally, there exist heuristic approaches that apply to both meshed and radial topologies and provide locally optimal solutions such as genetic algorithm-based schemes [23] and Lagrangian-based nonlinear optimization methods [24].…”
Section: Introductionmentioning
confidence: 99%
“…The challenge with current model-based methods is that solving the OPF for dispatching and other applications for large systems is computationally intensive and therefore often cannot exploit the full prior knowledge on the uncertainty [5,19,22]. Especially when updates to the dispatch plan are to be carried out intra-day, the available computational time is limited [18].…”
Section: Introductionmentioning
confidence: 99%