Toi-Uu-Hoa-Van-Hanh-He-Thong-Dien - Vo-Ngoc-Dieu - Chapter-3 - Economic-Dispatch - (Cuuduongthancong - Com)

2/16/2014
TỐI ƯU HÓA VẬN HÀNH

HỆ THỐNG ĐIỆN
Chapter 3:
ECONOMIC DISPATCH AND SOLUTION
METHODS
om
.c
Dr. Vo Ngoc Dieu
Department of Power Systems
Ho Chi Minh City University of Technology
ng
Email: vndieu@gmail.com
co
1
an
th
g
on
du
u
cu
CuuDuongThanCong.com https://fb.com/tailieudientucntt
2/16/2014
om
.c
ng
co
3
an
th
g
on
du
u
cu
2/16/2014
om
.c
ng
co
5
an
th
g
on
du
u
cu
2/16/2014
om
.c
ng
co
7
an
th
g
on
du
u
cu
2/16/2014
om
.c
ng
co
9
an
th
g
on
du
u
cu
10
2/16/2014
om
.c
ng
co
11
an
th
g
on
du
u
cu
12
2/16/2014
om
.c
ng
co
13
an
th
g
on
du
u
cu
14
2/16/2014
om
.c
ng
co
15
an
th
g
on
du
u
cu
16
2/16/2014
om
.c
ng
co
17
an
th
g
on
du
u
cu
18
2/16/2014
om
.c
ng
co
19
an
th
g
on
du
u
cu
20
10
2/16/2014
om
.c
ng
co
21
an
th
g
on
du
u
cu
22
11
2/16/2014
om
.c
ng
co
23
an
th
g
on
du
u
cu
24
12
2/16/2014
om
.c
ng
co
25
an
th
g
on
du
u
cu
26
13
2/16/2014
om
.c
ng
co
27
an
th
g
on
du
u
cu
28
14
2/16/2014
om
.c
ng
co
29
an
th
g
on
du
u
cu
30
15
2/16/2014
om
.c
ng
co
31
an
th
g
on
du
u
cu
32
16
2/16/2014
om
.c
ng
co
33
an
th
g
on
du
u
cu
34
17
2/16/2014
om
.c
ng
co
35
an
th
g
on
du
u
cu
36
18
2/16/2014
om
.c
ng
co
37
an
th
g
on
du
u
cu
38
19
2/16/2014
om
.c
ng
co
39
an
th
g
on
du
u
cu
40
20
2/16/2014
om
.c
ng
co
41
an
th
g
on
du
u
cu
42
21
2/16/2014
om
.c
ng
co
43
an
th
g
on
du
u
cu
44
22
2/16/2014
om
.c
ng
co
45
an
th
g
on
du
u
cu
46
23
2/16/2014
om
.c
ng
co
47
an
th
g
on
du
u
cu
48
24
2/16/2014
om
.c
ng
co
49
an
th
g
on
du
u
cu
50
25
2/16/2014
om
.c
ng
co
51
an
th
g
on
du
u
cu
52
26
2/16/2014
om
.c
ng
co
53
an
th
g
on
du
u
cu
54
27
2/16/2014
Lagrange Relaxation - Dual Variables

Another way to solve an optimization problem is to use a technique that
solves for the Lagrange variables directly and then solves for the problem
variables themselves.
⇒ Dual Solution formualtion
Primal Problem :
Min f(x1 , x 2 ) = 0.25x12 + x 22
s.t. h(x1 , x 2 ) = 5 - x1 - x 2
om
L(x1 , x 2 , λ ) = 0.25x12 + x 22 + λ(5 - x1 - x 2 )
If we define a dual function q(λ )
q(λ ) = Min L(x1 , x 2 , λ ) (fix λ )
.c
x1 , x 2
Then the " dual problem" is to find

q * (λ ) = Max q(λ )
λ ≥0
ng
(fix x1 , x 2 )
co
55
an
th
g

on
Two separate optimization problem

du
q(λ ) = Min L(x1 , x 2 , λ ) ⇔ Max q(λ ) = q* (λ )

x1 , x 2 λ ≥0
∂L
= 0.5x1 − λ = 0 ⇒ x1 = 2λ
∂x1
u
∂L λ
cu
= 2x 2 − λ = 0 ⇒ x 2 =
∂x 2 2
λ λ
2

q(λ ) = 0.25(2λ ) 2 +   + λ  5 − 2λ − 
2  2
λ2 λ2 λ
= λ2 + + 5λ − 2λ2 − or 0 = 5 − x1 − x 2 = 5 − 2λ −
4 2 2
5 2 5λ
= − λ + 5λ = 5−
4 2
∂q(λ ) 5λ
= − +5 ⇒ λ = 2
∂λ 2
56
28
2/16/2014

∴ q * (λ ) = 5
x1 = 4
x2 = 1
In some optimizati on problems, one cannot eliminate the problem variables
since the objective functions may be complex functions.
We first optimize on λ
q * ( λ ) = Max q( λ )
λ ≥0
om
We don' t have explicit function in λ ,
 dq( λ ) 
λ ′ = λ0 +  ⋅ α ⇒ Gradient adjustment
 dλ 
.c
dq( λ )
α = 0.5 when is positive
dλ
dq( λ )
and α = 0.1 when
dλ
is negative ng
co
57
an
th
g

on
du
The closeness to the final solution in the dual optimizaiton is the relative
" gap" between primal function and dual funciton.
u
cu
The optimal value of primal optimization

J * = Min L = Min 0.25x12 + x 22 + λ(5 - x1 - x 2 )
x1 , x 2
This value will be compared to the optimal value of the dual

funciton, q * .
J* − q*
Relative duality gap =
q*
58
29
2/16/2014
Iteration 1 : λ(1) = 0
x1(1) = 2λ(1) = 0
λ(1)
2 =
x (1) =0
2
h(x1 , x 2 ) = 5 - x1(1) − x (1)
2 = 5.0
5
q* (λ ) = - λ2 + 5λ = 0
 4
om
J −q
* *
5-0
= =?
q* 0
.c
dq 5
= - λ +5 =5
dλ 2
ng
co
59
an
th
g

on
 dq 
λ(2) = λ(1) +   ⋅ α = 0 + 5(0.5) = 2.5
du
Iteration 2 :
 dλ 
x1(1) = 5
2 = 1.25
u
x (1)
h(x1 , x 2 ) = −1.25
cu
5
q* (λ ) = - ( 2.5) 2 + 5( 2.5) = 4.6875
4
J* − q * 5 - 4.6875
= = 0.0666
q* 4.6875
• For convex problem with continuous variables, the duality gap will become zero at the
final iteration.
• For nonconvex and non - continuous variables, the duality gap will never actually go to
zero ⇒ λ search technique.
60
30
2/16/2014
J* − q*
Iteration λ x1 x2 h(x) J *
q*
q*
1 0 0 0 5.0 5.0 0 -
2 2.5 5.0 1.25 -1.25 5.0 4.6875 0.0666
3 2.375 4.75 1.1875 -0.9375 5.0 4.8242 0.0364
om
4 2.2813 4.5625 1.1406 -0.7031 5.0 4.9011 0.0202
.c
20 2.0028 4.0056 1.0014 -0.007 5.0 5.0 0
ng
co
61
an
th
g
on
du
u
cu
31

Toi-Uu-Hoa-Van-Hanh-He-Thong-Dien - Vo-Ngoc-Dieu - Chapter-3 - Economic-Dispatch - (Cuuduongthancong - Com)

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Toi-Uu-Hoa-Van-Hanh-He-Thong-Dien - Vo-Ngoc-Dieu - Chapter-3 - Economic-Dispatch - (Cuuduongthancong - Com)

Uploaded by

Copyright:

Available Formats

2/16/2014

TỐI ƯU HÓA VẬN HÀNH

Lagrange Relaxation - Dual Variables

⇒ Dual Solution formualtion

Then the " dual problem" is to find

Lagrange Relaxation - Dual Variables

Two separate optimization problem

q(λ ) = Min L(x1 , x 2 , λ ) ⇔ Max q(λ ) = q* (λ )

Lagrange Relaxation - Dual Variables

Lagrange Relaxation - Dual Variables

The optimal value of primal optimization

This value will be compared to the optimal value of the dual

Lagrange Relaxation - Dual Variables

Lagrange Relaxation - Dual Variables

Lagrange Relaxation - Dual Variables

You might also like