Rilwan Monday
Rilwan Monday
ADEBAYO Rilwan L
1 Objective function
The cost function of each generating unit i, is represented by a quadratic equation, a rectified sine term
is added to model the valve-point loading effect 1.1. The EDP over the generating units considered is
formulated as:
n
X
Ci (Pi ) = ai Pi2 + bi Pi + ci + |ei sinfi (Pimin − Pi )| (1.1)
i=1
Where ai , bi , ci are cost coefficients of the generators. ei and fi are the fuel cost coefficients of the ith
1
1. Power Balance -(The equality constraints)
n
X
Pi − PD − PL = 0 (1.2)
i=1
The objective function is a non-convex function due to the rectified sine term. The first task is to convert
Let the rectified sine function part of equation 1.1 be represented by a quadratic function Q(Pi ) such
e = 300;
f = 0.0315;
P_min = 100;
title ( ' Rectified sine function | e_isinf_i ( P_i ^{ min } - P_i ) | ') ;
2
ylabel ( ' Cost ( F_i ( P_i ) ) ') ;
The plot of the rectified sine function is shown below in figure 2.1
Fitting the rectified sine wave to the quadratic curve, Q(Pi ) becomes
We do the poly fitting to get values for αij , βij , and γij . In order to take the curve, one at a time, We fit
over the zero points or non-differentiable points. So, the first curve is between Pimin and the next point
We can call that point the zero point ndth and we know from trigonometry that sine function is zero at
nπ.
so
nπ
ndth = Pimin + (2.5)
fi
3
Fitting the first curve which is between Pimin and the ndth equation when n is 1.
n =1;
e = 300;
f = 0.0315;
% P min
P_min = 100;
nd_point = ( P_min + ( n * pi / f ) ) ;
a = p (1) ;
b = p (2) ;
c = p (3) ;
hold on ;
4
legend ( ' Data ' , ' Quadratic Fit ') ;
grid on ;
The αi1 , βi1 , and γi1 gotten are The coefficients gotten for the first curve are;
a = -0.12389
b = 37.1325
c = -2488.6357
>>
The quadratic fitting would be done for the j th curve, and the coefficients for the curves would be found
as well.
The objective function combining the quadratic fit of the rectified sine function is shown in equations
2.6 to 2.8;
n
X
Fi (Pi ) = ai Pi2 + bi Pi + ci + Q(Pi )ij (2.6)
i=1
n
X
Fi (Pi ) = ai Pi2 + bi Pi + ci + αij Pi2 + βij Pi + γij (2.7)
i=1
5
n
X
Fi (Pi ) = (aij )Pi2 + (bij )Pi + (cij ) (2.8)
i=1
For j th curves, it means we’d have j th sets of quadratic functions, and have to find the max first of the
functions since the quadratic curves would have a maximum since it opens down. Our objective function
is 2.9;
n
X
Ci (Pi ) = max{(aij )Pi2 + (bij )Pi + (cij )} (2.9)
i=1
Let the auxiliary variable yi capture the maximum value across the segments such that:
yi
≥ cij
2
1 −aij −bij (3.4)
Pi
Pi
A second-order cone program to solve a quadratic objective function and SOC constraints.
min xT Qx + cT x (4.1)
si ≥ aik Pi2
6
The second-order cone constraints (SOCP), can be written in the norms as follows:
√
2 a P
i i
≤ si + 1 (4.3)
1 − si
2
min yi (4.6)
Subject to:
1. The SOC
√
2 ai Pi
≤ si + 1 (4.7)
1 − si
2
aTi x ≤ bi (4.8)
yi
−1 −bij ≥ cij (4.9)
1 si
Pi
n
X
Pi − PD − PL = 0 (4.10)
i=1