TET 4115 - 2015 Solution To Assignment 8
TET 4115 - 2015 Solution To Assignment 8
(i)
The following distribution of the variables is selected because it fulfils the requirement
for a square Jacobian matrix, and because it has the least number of state variables which
reduces the amount of calculation necessary.
-1-
Bus
1
2
3
Note:
U
|V2|
|V3|
P
|V1|, 1
P2
P3
X
2
3
W
P1, Q1
Q2
Q3
This is not the only solution, but a typical one. The required number
of calculations decreases with decreasing number of state variables.
NB: There MUST be the same number of P and Q in
(ii).
Generally:
n
Pi Yij Vi Vj cos i j ij
j1
In this case:
3
Pi | V |, Yij Vi Vj cos i j ij
j1
Pi Pi | V |, Pisp 0
P2 P2 | V |, P2sp 0
& P3 P3 | V |, P3sp 0
(iii). In ordinary power flow active power is specified at every bus except for the swing
bus. Reactive power is specified for all PQ nodes. We wish to find a set of equations which
can be used to find the specified values of P and Q. Newtons iteration method can be used
on the equations, which results in a linearization around an operating point. The power
flow equations must be found in order to calculate P and Q in the operating point.
Ordinary power flow is a subroutine of the optimal power flow procedure, which is why
the power flow equations are also used here.
-2-
P2sp and P3sp are constant, which means that minimization of the active losses is the same
as minimizing P1, because all constant terms become 0 when they are differentiated.
(v). The optimal power flow procedure iterates to find the optimal solution with respect
to the objective function. For each iteration, a number of variables are selected as control
variables, and their values can be regulated within given limits to reach the optimal value
of the objective function. Though, for each individual iteration the control variables are
assigned fixed values which are used in the ordinary power flow calculation.
(vi).
In order to find the numerical values of the various partial derivatives, refer to the
complete Jacobian expression given in the Appendix of the exercise.
F=P1 P2sp P3sp
X 2
3
P1
F 2 10.034
X P 18.975
1
3
P2
G 2
X P
3
2
P2
3 28.963 -19.015
P3 -19.054 37.744
3
P1
F | V2 | 0.564
U P 3.117
1
| V |
3
P2
G | V2 |
U P
3
|V |
2
P2
| V3 | 4.489 3.985
P3 3.672 6.722
| V3 |
-3-
F
X
G
X
F
U
G
U
(vii).
1
T
G T F 28.963 -19.015 10.034 1.012
(viii).
F
can be written as: X
F
which in turn can be written as
G
G
X
L
T
T
T 1
L | V2 | F G
F G G F
L
U L U U
U U X X
| V |
3
L
| V | 0.259
L 2
L 0.340
| V |
3
-4-
(x).
From (ix):
L
L
0.259 positive value;
0.340 negative value
| V2 |
| V3 |
Voltage at bus 2 must be reduced and voltage at bus 3 must be increased for the objective
function to be optimized. When an optimum is reached, then the gradient is zero (unless
the variable has reached its limit).
Explanation:
From the Gradient Descent algorithm, we know that:
For minimization:
Ui1 Ui Ui
where Ui (step length) L
Ui
L
Ui
If
L
is positive :
u1
L
is positive, then u1 must be negative. (
u1
Since
u1
L
)
u1
L
is positive, i.e., 0.259,
| V2 |
If
L
is negative :
u2
L
is negative, then u2 must be positive. (
u2
Since
u2
L
)
u2
L
is negative, i.e., 0.340,
| V3 |
-5-