Professional Documents
Culture Documents
) + C
1
(Q
+
+Q
)].
ueneially, u < a < .1. Foi a lineai appioximation, a step function appioximation can
be useu. Beie a is set to u.1.
Page8
Peifoimance Neasuies. Foi powei system uispatch, iobustness is impoitant to
opeiations. An impoitant metiic of powei systems opeiation softwaie is a goou
feasible solution within a specifieu time winuow. Foi the test pioblems, we can
bieak this into two uimensions: CP0 time to conveige, that is, the fiaction of the
time that a goou usable local optimal solution was founu, anu iobustness, that is,
the ability to finu a goou usable solution.
The lineai piogiam is a fuithei appioximation of the nonlineai piogiam.
Theiefoie, we uevelop a nonlineai feasibility test to measuie the 1noim uistance
of the lineai piogiam optimal solution vaiiables fiom a nonlineai feasible solution.
Let v
i
*, v
j
*, I
i
*, I
j
*, P*, Q* be an optimal solution to the lineai piogiam. By the
foimulation, v
i
*, v
j
*, I
i
*, I
j
* is a feasible solution to the flow equations. Let
v
m
= (v
i
*v
i
*
+ v
j
*v
j
*)
12
P = v
i
*I
i
* + v
j
*I
j
*
Q = v
j
*I
i
* v
i
*I
j
*
P anu Q aie the implieu injections fiom the flow equations anu v
m
is the voltage
magnituue. We calculate feasible noimalizeu ueviation metiics foi v, P, anu Q as
follows. Foi voltage magnituue feasibility excuisions, foi each bus, n, set v
f
n
= u.
if v
m
n
> v
max
n
, v
f
n
= v
m
n
v
max
n
.
if v
m
n
< v
min
n
, v
f
n
= v
m
n
v
min
n
.
Theiefoie if v
f
n
= u, the voltage is within its magnituue bounus. if v
f
n
> u, the voltage
exceeus its maximum level. If v
f
n
< u, the voltage is less than its minimum level.
We now sum the absolute value of the ueviations anu noimalize by the numbei of
buses, obtaining the total infeasibility voltage metiic:
v
u
=
n
abs(v
f
n
)n.
The maximum infeasibility voltage metiic is:
v
umax
= max
n
{abs(v
f
n
)].
Foi noual ieal powei imbalances, feasibility excuisions, foi each bus, n,
set p
f
n
= u.
If p
n
> p
max
n
, p
f
n
= abs(p
n
p
max
n
).
If p
n
= p
max
n
anu p
max
n
= p
min
n
, p
f
n
= abs(p
n
p
flow
n
)
wheie p
flow
n
=
k
abs(p
flow
kn
)2.
If p
n
= p
max
n
anu p
max
n
= p
min
n
, p
f
n
= u.
If p
n
< p
min
n
, p
f
n
= abs(p
n
p
min
n
).
If p
f
n
= u, the ieal powei is within its magnituue bounus. If p
f
n
> u, the ieal powei
exceeus its maximum level oi p
n
= p
max
n
anu p
max
n
= p
min
n
. If p
f
n
< u, the ieal powei
is less than its minimum level.
We now sum the absolute value of the ueviations anu uiviue by the numbei of buses,
obtaining the total infeasibility ieal powei metiic:
p
u
=
n
abs(p
f
n
)n.
The total maximum infeasibility ieal powei metiic is:
Page9
p
umax
= max
n
{abs(p
f
n
)].
We uefine q
f
n
, q
u
, anu q
umax
in the same way.
v
u
, P
u
anu Q
u
measuie the total infeasibility implieu by the nonlineai equations.
v
umax
, P
umax
anu Q
umax
measuie the maximum infeasibility implieu by the nonlineai
equations.
We test solveis with anu without ielaxation slack vaiiables. Relaxation slack
vaiiables aie iemoveu by setting the uppei bounu on the slack vaiiables to zeio. We
also auu an auuitional noim foi active ielaxation slack vaiiables:
Tepsinoim =
n
(p
minepsi
n
+ p
maxepsi
n
)p
usum
+
n
(q
minepsi
n
+sq
maxepsi
n
)q
usum
+
n
(v
minepsi
+ v
maxepsi
n
)
If Tepsinoim is less than epsilon, we consiuei the solution acceptable anu
iemove the penalty values fiom the objective function. If not, it is iecoiueu as a
feasibility violation, that is, TEPSIN = TEPSIN +1.
Paiametei Setting. The ielaxation penalty was set at 1u
7
. NaxLin is the maximum
numbei of calls to the lineai solvei. It is set at 1u. feasum is the sum of noimalizeu
infeasibilities. It is set to u.uS. maxfeas is the maximum noimalizeu infeasibilty. It is
set to u.u1. The LP teiminates when any of the thiee conuitions aie met. Tepsi is the
infeasibility test baseu on the magnituue of the penalty slacks.
S. Results foi Each Test Pioblem
We stait by piesenting summaiy iesults foi each test pioblem. Noie uetaileu
iesults aie in the appenuix
14bus pioblem. Without ielaxation slack vaiiables, all solveis with the exception of
KNITR0 founu a neai global optimal solution foi each staiting point. 0n aveiage,
SN0PT, C0N0PT anu NIN0S weie the fastest solveis. u0R0BI was competitive with
the nonlineai solveis on the 0PF. Compaiing 0PF anu 0PFp, using the LP
appioximation final solution as the staiting point uiu not lowei cpu time. The flat
stait uoes bettei than the aveiage ianuom staiting point.
With ielaxation slack vaiiables, all solveis ueclaie a local optimal solution foi
each staiting point, but only C0N0PT anu IP0PT finu the global optimal value. The
othei solveis finu local optimal solutions neai the global optimal value. 0n aveiage
NIN0S is the fastest solvei followeu by C0N0PT. SN0PT is eiiatic, at times, woiking
well anu at times, appeaiing to get hung up. 0veiall, since C0N0PT is the seconu
fastest anu always finus a global optimum, C0N0PT outpeifoims the othei
nonlineai solveis.
Foi the lineai solveis, u0R0BI outpeifoims CPLEX in cpu time. The optimal
solution values aie within 1 peicent of the best nonlineai solveis, conveiging in 4 to
7 lineai piogiam passes. u0R0BI anu CPLEX aie fastei with ielaxation slack
vaiiables.
Page
10
We compaie a C0N0PT 0PF solution to a u0R0BI 0PFlin lineai
appioximation solution. The 0PF solution anu 0PFlin solution have only minoi
uiffeiences in noual piices foi ieal anu ieactive powei. The objective function values
uiffei by less than one peicent. The voltage magnituues anu uual vaiiables fiom the
bus equations aie similai, but the actual geneiatoi uispatch (ieal anu ieactive)
uiffeis somewhat. This is not suipiising since the suiface neai the optimal solution
is ielatively flat (see Schectei anu 0Neill, 2u1S).
A stanuaiu test foi iobustness is incieasing uemanu. The maximum ieal
powei geneiation is 7.724 anu the fixeu ieal uemanu is 2.S9. The maximum
possible uemanu inciease factoi is 2.98. We solve the 14bus pioblem with uemanu
multiplieu by 1.S, 2 anu 2.S. The pioblems iequiie incieasing CP0 time. When
uemanu is 2.S times gieatei, the penalty slacks aie gieatei than the set thiesholu. In
2x anu 2.Sx uemanu, C0N0PT uiu not conveige on two staiting points, but the
u0R0BI solutions weie iobust.
Subus pioblem. Without ielaxation vaiiables, all solveis with the exception of
KNITR0 finu the same optimal solution foi all staiting points. 0n aveiage, SN0PT,
C0N0PT anu NIN0S weie the fastest solveis anu solve 0PFp fastei than 0FP2 anu
0PF. NIN0S, C0N0PT anu IP0PT solve fastei than u0R0BI solveu 0PFlin.
With ielaxation slack vaiiables, all solveis ueclaie a local optimal solution,
but only C0N0PT anu IP0PT finu the global optimal value. The othei solveis finu
optimal solutions neai the global optimal value. 0n aveiage, SN0PT is the fastest
solvei followeu by C0N0PT. C0N0PT outpeifoims the othei nonlineai solveis on
the 0PFp wheie SN0PT appeais to get hung up on some pioblems. KNITR0 is veiy
eiiatic at times woiking well anu at times appeaiing to get hung up. 0veiall,
C0N0PT outpeifoims the othei nonlineai solveis in finuing the global optimal
solution.
Foi the lineai solveis, u0R0BI outpeifoims CPLEX. The optimal solution
values aie within 1 peicent of the best nonlineai solveis. u0R0BI is not as fast as
SN0PT, but finus a bettei solution on 0PF. C0N0PT outpeifoims u0R0BI. The lineai
solveis uo not to have pioblems with ielaxation slack vaiiables.
We compaie the 0PF C0N0PT solution to the u0R0BI 0PFlin solution anu
finu uiffeiences in P, Q anu v anu noual piices foi ieal anu ieactive powei. The
actual geneiatoi uispatch is ieasonably close anu the objective function value uiffeis
by less than one peicent. We solve the Subus pioblem with uemanu multiplieu by
1.2, 1.4 anu 1.6. The iesults aie not maikeuly uiffeient.
S7bus Pioblem. Without ielaxation slack vaiiables, all solveis except KNITR0 finu
the global optimal value foi all staiting points. SN0PT, C0N0PT anu NIN0S aie the
fastest nonlineai solveis. u0R0BI is fastei on 0PFlin than any nonlineai solvei.
Without ielaxation slack vaiiables foi 0PF2, C0N0PT peifoims bettei on the flat
stait than any ianuom staiting point. Foi 0PF2 on thiee staiting points, C0N0PT
Page
11
got hung up. Foi the 0PF, C0N0PT peifoims bettei on the flat stait than on most
ianuom staiting points.
With ielaxation slack vaiiables, only C0N0PT anu IP0PT finu the global
optimal value. The othei solveis finu optimal solutions neai the global optimal
value. SN0PT is the slowest solvei anu gets hung up on some pioblems. C0N0PT
outpeifoims the othei nonlineai solveis on the 0PF2 anu 0PF, but C0N0PT fails to
conveige on one pioblem, anu has highei optimal values. Foi lineai solveis, CPLEX
times bounu the u0R0BI times. The optimal solution values aie within 1 peicent of
the best nonlineai solveis. With uemanu incieaseu by 1.S, 2 anu 2.S, minoi
uiffeiences aie obseiveu.
We compaie the C0N0PT 0PF solution to the u0R0BI 0PFlin solution anu
finu only minoi uiffeiences in P, Q anu v anu noual piices foi ieal anu ieactive
powei. The voltages anu uual vaiiables aie similai but the actual geneiatoi uispatch
is uiffeient, anu the objective function value uiffeis by less than one peicent.
118bus Pioblem. Without ielaxation slack vaiiables, all solveis except KNITR0 finu
the global optimal value foi all staiting points. SN0PT, C0N0PT anu NIN0S aie the
fastest solveis. CPLEX anu u0R0BI aie fastei on 0PFlin than any nonlineai solvei,
except NIN0S. 0PFp uiu not solve fastei than the 0PF.
With ielaxation slack vaiiables, all nonlineai solveis have tiouble. 0nly
C0N0PT anu KNITR0 finu the optimal solution foi the 0PF2. C0N0PT, IP0PT anu
KNITR0 founu the optimal solution to the 0PF. With ielaxation slack vaiiables,
C0N0PT founu optimal values neai the optimal value anu peifoimeu bettei on the
flat stait than the aveiage ianuom staiting point foi 0PF2 anu 0PF.
With ielaxation slack vaiiables, all nonlineai solveis have tiouble solving the
pioblems. 0nly C0N0PT anu KNITR0 finu the optimal solution foi the 0PF2.
C0N0PT, IP0PT anu KNITR0 founu the optimal solution to the 0PF. Foi lineai
solveis, u0R0BI anu CPLEX have similai peifoimance with ielaxation slack
vaiiables. The optimal solution values aie within 2 peicent of the best nonlineai
solvei peifoimance. With uemanu incieaseu by 1.2 anu 1.4, 0PFlin is moie iobust.
Suubus pioblem. Without ielaxation slack vaiiables, all solveis ueclaie an infeasible
pioblem. With ielaxation slack vaiiables, all solveis except KNITR0 ueclaie a local
optimal solution, but occasionally fail to iemove the penalty slacks. 0nly C0N0PT
anu IP0PT finu the global optimal value.
Foi lineai solveis, u0R0BI outpeifoims CPLEX. The optimal solution values
aie within S peicent of the best nonlineai solveis. All lineai appioximations took
the full 1u passes anu uiu not meet the othei conveigence ciiteiia. The lineai solveis
weie moie iobust than the nonlineai solveis. With uemanu incieaseu by 1.2 anu
1.4, the pioblems iequiie moie CP0 time, the penalty slacks aie gieatei than the set
thiesholu anu conveigence becomes moie uifficult.
Page
12
4. Summaiy of Results anu Conclusions.
In geneial, the Iv lineai appioximation solves fastei than the nonlineai
solveis useu in this stuuy. The iteiative lineai piogiam appioach appeais to finu a
neai feasible anu neai optimal solution in almost all pioblems anu staiting points.
The accuiacy of the nonlineai solveis is bettei when the optimal solution is founu.
0n seveial staiting points, the nonlineai solveis faileu to conveige oi containeu
positive ielaxation vaiiables above the thiesholu. The flat stait is supeiioi to
ianuom staits. 0PF solves fastei than 0PF2. The iankeu peifoimance of the
nonlineai solveis changes uepenuing on the test pioblem.
The lineai piogiam appioximation is moie iobust anu consistent acioss
staiting points. In some instances, the lineai solution vaiiables uo not match closely
to the nonlineai solution vaiiables, but aie close to feasible solutions. This is not
suipiising since the suiface neai the optimal is ielatively flat (see Schectei anu
0Neill). Even the ciuue implementation of the iteiative lineai piogiam appioach is
fastei than the nonlineai solveis. 0sing the lineai appioximation appioach opens up
the possibility of solving the AC optimal topology anu AC optimal unit commitment
pioblems fastei using NIP algoiithm.
.
Page
13
Refeiences
Naiy B. Cain, Richaiu P. 0Neill, Anya Castillo, Bistoiy of 0ptimal Powei Flow anu
Foimulations, FERC technical papei, Becembei, 2u12
}avau Lavaei anu S. B. Low, Zeio uuality gap in optimal powei flow pioblem, IEEE
Tiansactions on Powei Systems, 27(1):921u7, Febiuaiy 2u12
Richaiu P. 0Neill, Anya Castillo Naiy B. Cain, The Iv Foimulation anu
Lineaiizations of the AC 0ptimal Powei Flow Pioblem, FERC staff technical papei,
Becembei, 2u12
A. Schectei anu R. P. 0Neill, Exploiation of the AC0PF Feasible Region foi the
Stanuaiu IEEE Test Set, FERC Technical Confeience, Bocket No. AB1u12uuS,
available at http:www.feic.govEventCalenuaiFiles2u12u626u8462S
Tuesuay,%2uSession%2uTC1,%2uSchectei%2u.puf, }une 26, 2u12.
B.C. Lesieutie, I.A. Biskens. Convexity of the Set of Feasible Injections anu Revenue
Auequacy in FTR Naikets. IEEE Tiansactions on Powei Systems, 2u(4), 179u1798,
2uuS.
I. A. Biskens, R.}. Bavy. Exploiing the powei flow solution space bounuaiy. IEEE
Tiansactions on Powei Systems, 16(S), S89S9S, 2uu1.
Page
14
Appenuix
Solution Statistics. The summaiy statistics aie ovei the set of staiting points. They incluue
0PTvAvu is the aveiage optimal solution.
CP0Avu is the aveiage cpu time.
CP0NAX is the maximum cpu time.,
C0NvRu foi nonlineai solveis is the numbei that iepoiteu conveigence ovei the
ten staiting points. Foi lineai solveis is the numbei of lineai piogiams solveu ovei
the ten staiting points.
0PTvSBv is the stanuaiu ueviation fiom the aveiage optimal solution.
CP0SBv is the stanuaiu ueviation fiom the aveiage cpu time.
0PTvCv is the coefficient of vaiiation (stanuaiu ueviationmean) of optimal values
CP0Cv is the coefficient of vaiiation (stanuaiu ueviationmean) of CP0 times
ITER is the numbei of uiffeient staiting points.
NIN0PF is the minimum objective function value founu.
0PTvAL is the optimal value ietuineu by the solvei.
0PTN is the objective solution value less the penalty value.
Pflow is the ieal powei flow thiough the bus
Qflow is the ieactive powei flow thiough the bus
In tables with the uual vaiiables, they aie fiom the bus equations,
P = v
i
*I
i
* + v
j
*I
j
*
Q = v
j
*I
i
* v
i
*I
j
*
Page
15
14bus pioblem
All solveis with the exception of KNITR0 founu the global optimal solution foi each
staiting point, see Table 14.1. 0n aveiage, SN0PT , C0N0PT anu NIN0S weie the fastest
solveis. Compaiing 0PF anu 0PFp, the LP appioximation staiting point uiu seem to help.
u0R0BI was competitive with the nonlineai solveis on the 0PF.
Table 14.1. Solution Statistics foi the 14Bus Pioblem foi the Nonlineai Solveis
Without Relaxation Slack vaiiables.
uate 2u12 S29
type optvavg optvcv cpuavg cpucv cpumax C0NvRu Tepsin
0PF2
C0N0PT 8u.81Su u.uuuu u.uS2u u.1S6u u.1u9u 1u u
NIN0S 8u.81Su u.uuuu u.u69u u.u8uu u.u94u 1u u
SN0PT 8u.81Su u.uuuu u.u7Su u.1S4u u.12Su 1u u
KNITR0 81.878u u.uu2u u.2SSu u.2u4u u.7SSu 1u u
IP0PT 8u.81Su u.uuuu u.S7uu u.u66u u.Suuu 1u u
0PF
SN0PT 82.762u u.uuuu u.uS9u u.u8Su u.u62u 1u u
C0N0PT 82.762u u.uuuu u.uS1u u.11Su u.u94u 1u u
NIN0S 82.762u u.uuuu u.uS2u u.u96u u.u78u 1u u
IP0PT 82.762u u.uuuu u.6u8u u.146u 1.S1uu 1u u
KNITR0 84.u92u u.uuSu 2.S8Su u.7SSu 2u.6u8u 1u
0PFp
NIN0S 82.762u u.uuuu u.u44u u.1S8u u.u78u 1u u
C0N0PT 82.762u u.uuuu u.u47u u.22Su u.11uu 1u u
SN0PT 82.762u u.uuuu u.u76u u.2u7u u.2uSu 1u u
IP0PT 82.762u u.uuuu u.SS6u u.uS8u u.484u 1u u
KNITR0 8S.u78u u.uu2u u.S6Su u.u68u u.S1Su 1u u
Btheta
u0R0BI 76.S91u u.uuuu u.uuSu u.u4uu u.uu4u 1u u
u0R0BI 76.S91u u.uuuu u.uu4u u.uSSu u.uuSu 1u u
u0R0BI 76.S91u u.uuuu u.uu4u u.u82u u.uu6u 1u u
CPLEX 76.S91u u.uuuu u.u18u u.uSuu u.u21u 1u u
CPLEX 76.S91u u.uuuu u.u19u u.117u u.u4uu 1u u
0PFlin
u0R0BI 82.29uu u.uuSu u.u41u u.S26u u.uu9u 6u u
u0R0BI 82.29uu u.uuSu u.u41u u.S7uu u.uu6u 6u u
u0R0BI 82.29uu u.uuSu u.u41u u.S8uu u.uu6u 6u u
CPLEX 82.SSuu u.uu4u u.u97u u.S1Su u.u18u S1 u
CPLEX 82.SSuu u.uu4u u.1u7u u.S1uu u.uSSu S1 u
Table 14.1a. Lineai Piogiam Passes foi u0R0BI by Staiting Point
With anu Without Relaxation Slack vaiiables
Staiting point 1 2 S 4 S 6 7 8 9 1u Total
Without 4 4 S 9 S 8 7 8 6 4 6u
With S 9 7 9 8 8 8 8 9 9 8u
Page
16
With ielaxation slack vaiiables, all solveis ueclaie a local optimal solution foi each
staiting point, but only C0N0PT anu IP0PT finu the global optimal value see Table 14.1i.
The othei solveis finu local optimal solutions neai the global optimal value. 0n aveiage
NIN0S is the fastest solvei followeu by C0N0PT. SN0PT is eiiatic, at times woiking well
anu at times appeaiing to get hung up. 0veiall, since it is the seconu fastest anu always
finus a global optimum, C0N0PT outpeifoims the iemaining nonlineai solveis.
Table 14.1i. Solution Statistics foi the 14Bus Pioblem with the Nonlineai Solveis
With Relaxation Slack vaiiables.
type 0PTvAvu 0PTvCv CP0Avu CP0Cv CP0NAX C0NvRu TEPSIN NIN0PT
0PF2
NIN0S 82.279 u.uu2 u.uS2 u.2S4 u.u94 1u u 81.849
C0N0PT 8u.81S u.uuu u.u8S u.u6S u.1u9 1u u 8u.81S
KNITR0 81.148 u.uu1 u.197 u.261 u.67u 1u u 81.uu9
IP0PT 8u.81S u.uuu u.4S2 u.u62 u.S62 1u u 8u.81S
SN0PT 8S.uS1 u.uuS 14.1S7 u.714 1u4.17 1u u 81.267
0PF
NIN0S 8S.u77 u.uu2 u.u42 u.129 u.u6S 1u u 84.S82
C0N0PT 82.762 u.uuu u.uS6 u.1S2 u.1u9 1u u 82.762
KNITR0 8S.S8S u.u1S u.17u u.uSS u.2S4 1u u 8S.u42
IP0PT 82.762 u.uuu u.446 u.uS8 u.S46 1u u 82.762
SN0PT 84.249 u.uu2 28.2S8 u.947 281.89 1u u 8S.S46
0PFp
NIN0S 8S.S4u u.uu1 u.uu8 u.S17 u.u16 1u u 82.894
C0N0PT 82.762 u.uuu u.u2u u.Su7 u.u62 1u u 82.762
KNITR0 84.767 u.u18 u.1S6 u.17S u.S28 1u u 82.9S4
IP0PT 82.762 u.uuu u.2S7 u.uS9 u.281 1u u 82.762
SN0PT 82.9S4 u.uu1 44.842 u.948 448.17 1u u 82.762
Foi the lineai solveis, u0R0BI outpeifoims CPLEX in cpu time. The optimal solution
values aie within 1 peicent of the best nonlineai solveis. ueneially, conveiging in 4 to 7
lineai piogiam passes (see table 14.2i). u0R0BI anu CPLEX aie fastei with ielaxation slack
vaiiables.
Page
17
Table 14.2i. Solution statistics foi the 14bus pioblem with the lineai solveis
with ielaxation slack vaiiables.
Bate 2u12 S1S
type 0PTvAvu 0PTvCv CP0Avu CP0Cv CP0NAX C0NvRu
BTBETA
u0R0BI 76.S91 u.uuu u.uu2 u.uSu u.uu2 1u
u0R0BI 76.S91 u.uuu u.uu2 u.uSu u.uu2 1u
u0R0BI 76.S91 u.uuu u.uu2 u.1SS u.uu4 1u
CPLEX 76.S91 u.uuu u.uu9 u.u49 u.u11 1u
CPLEX 76.S91 u.uuu u.u1u u.111 u.u2u 1u
0PFlin
u0R0BI 82.4u2 u.uuS u.u22 u.Su6 u.uuS S6
u0R0BI 82.4u2 u.uuS u.u22 u.281 u.uuS S6
u0R0BI 82.4u2 u.uuS u.u24 u.SS2 u.uu4 S6
CPLEX 82.S68 u.uuS u.u6S u.12S u.uu8 62
CPLEX 82.S68 u.uuS u.u6S u.214 u.uu8 62
Table 14.S iepoits the test iesults iun on a uiffeient uay. The notable uiffeience is in the
iepoiteu times.
Table 14.S. Solution statistics at a uiffeient time with ielaxation slack vaiiables.
0PTvAvu 0PTvCv CP0Avu CP0Cv CP0NAX C0NvRu TEPSIN
0PF2
NIN0S 82.279 u.uu2 u.uS4 u.2uS u.1u9 1u u
C0N0PT 8u.81S u u.u67 u.147 u.1u9 1u u
KNITR0 81.48 u.uu4 u.194 u.187 u.484 1u u
IP0PT 8u.81S u u.49S u.u49 u.624 1u u
SN0PT 8S.uS1 u.uuS 16.429 u.7S4 12S.612 1u u
0PF
C0N0PT 82.762 u u.uSS u.178 u.u94 1u u
NIN0S 8S.u77 u.uu2 u.uS9 u.127 u.u94 1u u
KNITR0 12S.766 u.26S u.222 u.1S8 u.48S 1u u
IP0PT 82.77S u u.S16 u.u61 u.6SS 1u u
SN0PT 84.249 u.uu2 S2.uS2 u.947 S19.848 1u u
0PFp
NIN0S 8S.S4 u.uu1 u.u16 u.444 u.u78 1u u
C0N0PT 82.762 u u.uSS u.227 u.u6S 1u u
KNITR0 87.747 u.uSS u.1SS u.u74 u.171 1u u
IP0PT 82.762 u u.2S1 u.u68 u.SS9 1u u
SN0PT 82.967 u.uu1 46.272 u.948 462.496 1u u
0PFlin
u0R0BI 82.4u7 u.uuS u.u22 u.247 u.uu4 S7 u
CPLEX 82.S68 u.uuS u.u6S u.17S u.u2 62 u
BTBETA
u0R0BI 76.S91 u u.uu2 u.u97 u.uu2 1u u
CPLEX 76.S91 u u.u11 u.1S1 u.u18 1u u
Page
18
C0N0PT. With ielaxation slack vaiiables, the 0PF2 foimulation hau 211 iows, 2S9 columns
884 nonzeioes, 14S nonconstant fiist ueiivatives with S6S evaluation opeiations. The 0PF
anu 0PFp foimulations hau 22S iows, S79 columns, 1,1S9 nonzeioes, 14u nonconstant
fiist ueiivatives nonzeioes with S22 evaluation opeiations. The uiffeience is uue to the
lineai objective function. With anu without ielaxation slack vaiiables foi all staiting points,
C0N0PT founu the optimal solutions of 8u.81 foi 0PF2 anu 82.76 foi 0PF anu 0PFp.
C0N0PT peifoimeu consiueiably fastei on 0PF anu 0PFp. The flat staiting point uiu not
impiove the piocess.
Table 14.4. C0N0PT peifoimance on the 14bus with anu without ielaxation slack vaiiables.
0PF2 0PF 0PFp
without with without With without with
stait iteiations iteiations iteiations iteiations iteiations iteiations
1 SS 122 29 SS 21 2u
2 47 9S S8 42 27 29
S Su 117 28 27 SS 24
4 Su 112 SS S8 42 19
S 67 87 29 S9 2S 28
6 S8 129 S6 S6 2u 24
7 S9 64 28 SS 21 2u
8 Su 86 SS Su S1 S6
9 48 1uS SS SS 21 2u
1u Su 1u2 S1 29 2S 18
aveiage 49 1u2 SS S6 27 24
KNITR0. With ielaxation slack vaiiables, the 0PF2 foimulation hau 2S8 vaiiables, 21u
constiaints (28 lineai equalities, 42 nonlineai equalities, 14u lineai inequalities), 794
nonzeios in the }acobian, anu 89 nonzeios in the Bessian 0PF anu 0PFp S78 vaiiables, 224
constiaints, (42 lineai equalities, 42 nonlineai equalities, 14u lineai inequalities) 948
nonzeios in the }acobian anu 84 nonzeios in the Bessian. The flat stait uoes bettei than the
aveiage ianuom staiting point.
Table 14.4. KNITR0 peifoimance on the 14bus without ielaxation slack vaiiables.
stait 0PF2 0PF 0PFp
point iteiations optvalu iteiations optvalu iteiations optvalu
1 144 8u.81S 1u2 82.762 84 82.762
2 169 8u.81S 1SS 82.762 9u 82.762
S 166 8u.81S 1SS 82.762 87 82.762
4 2u2 8u.81S 14S 82.762 86 82.762
S 1S9 8u.81S 126 82.762 87 82.762
6 222 8u.81S 1S1 82.762 91 82.762
7 184 8u.81S 92 82.762 89 82.762
8 189 8u.81S 1S8 82.762 91 82.762
9 172 8u.81S 99 82.762 89 82.762
1u 162 8u.81S 1S2 82.762 91 82.762
avg 177 8u.81S 129 82.762 89 82.762
Page
19
With ielaxation slack vaiiables foi one ianuom staiting point KNITR0 ueclaieu
conveigence with an objective value of 169.8u with ielaxation slack vaiiables active at veiy
low levels anu an objective value of 99.u14 when the penalty values aie iemoveu. KNITR0
also hau tiouble with the ieactive powei foimulation of Q = Q
+
Q