Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
22
D
x 1
A
C
33
Convexity
If the feasible set is convex and the objective function is convex, there is only one minimum and it is thus the global minimum
55
x 2
x 1 x 2
x 1
x1mi x1m n ax 2011 Daniel Kirschen and University of 2011 Daniel Kirschen and
x 1 66
x 1
x 2
x 1 x 2
x 1
x 1
x 1 77
x 1
Example of Convex Feasible Sets A set is convex if, for any two points belonging to the set, all the
points on the straight line joining these two points belong to the set
x 2
x 2
x 1 x 2
x 1
x1mi x1m n ax 2011 Daniel Kirschen and University of 2011 Daniel Kirschen Washington
x 1 88
x 1
x 1 x 2
x 1
x 1
x 1 99
x 1
1010
x 2
x 1 1111
1212
1313
D
x 1
A
C
A convex function is a function such that, for any two points xa and xb belonging to the feasible set and any k such that 0 k 1, we have:
1414
1515
Importance of Convexity
Then, the problem has one and only one solution Proving convexity is often difficult Power system problems are usually not convex There may be more than one solution to power system optimization problems
1616