Professional Documents
Culture Documents
ECEG-6311 Power System Optimization and AI
ECEG-6311 Power System Optimization and AI
Page 1
Outlines
Optimization Definition
Basic Optimization Principles
Optimization Problem
Constrained
Unconstrained
Design Vector
Design Constraints
Objective Function
Classification Of Optimization Problems
Page 2
Optimization
Optimization is the act of obtaining the best result under
given circumstances.
Optimization can also be defined as the process of finding
the conditions that give the maximum or minimum value of a
function.
The beginnings of the subject of operations research can
be traced to the early period of World War II by British
military for allocating very scarce and limited resources
(such as fighter airplanes, radars, and submarines).
Page 3
…Contd..
There is no single method available for solving all
optimization problems efficiently.
Hence a number of optimization methods have been
developed for solving different types of optimization
problems.
Page 4
Basic Optimization Principles
If a point „x‟ corresponds to the minimum value of
function f(x), the same point also corresponds to the
maximum value of the negative of the function, −f(x).
Hence optimization can be taken to mean minimization
since the maximum of a function can be found by seeking
the minimum of the negative of the same function.
Page 5
…Contd..
In addition, the following operations on the objective
function will not change the optimum solution x as shown
below.
1. Multiplication (or division) of f(x) by a positive constant c,
cf(x).
2. 2.Addition (or subtraction) of a positive constant c to (or
from) f(x), c+f(x) or f(x)-c.
Page 6
Optimization Problem
It can be constrained or unconstrained type depending on
the system needing the optimization.
Constrained Optimization Problem
Design Vector
Quantities are usually fixed at the outset and these are
called pre assigned parameters.
All the other quantities are treated as variables in the
design process and are called design or decision variables
Xi, i = 1, 2, . . . n.
The design variables are collectively represented as a
design vector X = {x1, x2, . . . , xn}T .
Page 8
…Contd..
Design Constraints
The restrictions that must be satisfied to produce an
acceptable design are collectively called design
constraints.
Constraint Surface
For optimization problem with only inequality constraints
gj (X) ≤ 0, the set of values of X that satisfy the equation
gj (X) = 0 forms a hyper surface in the design space and is
called a constraint surface.
Objective Function
The function which gives the relation between the
objective we want to achieve and the variables involved.
Single or multiple
Page 9
…Contd..
Example : Power System Case
Economic Dispatch Problem
Objective Function: Minimize Operating Cost
Variables: Output of each generator
Constraint: System load demands, generating capacity of generators
Example : Arbitrary Mathematical Equation
Page 10
Basic Classification of optimization problems
Classification Based on the Existence of Constraints
1. Constrained
Minimize f(x)
2. Unconstrained
Minimize f(x)
Page 11
…Contd..
Classification Based on the Nature of the Design Variables
1. Static: Design variables are simple variables
where ρ is the density and δtip is the tip deflection of the beam.
2. Dynamic: Design variables are function of other variables
Page 12
…Contd..
Classification Based on the Nature of the Equations
Involved
1. Linear Programming Prolem
If the objective function and all the constraints are linear
functions of the design variables, the mathematical
programming problem is called a linear programming (LP)
problem.
Page 13
…Contd..
2. Non Linear Programming Problem
If any of the functions among the objective and
constraint functions in is nonlinear, the problem is called a
nonlinear programming (NLP) problem.
This is the most general programming problem and all
other problems can be considered as special cases of the
NLP problem.
Page 14
…Contd..
3. Geometrical Programming Problem
A geometric programming (GMP) problem is one in which
the objective function and constraints are expressed as
posynomials (sum of power terms e) in X.
Posynomials:
General Form
Page 15
…Contd..
Example: Helical Spring
Page 16
…Contd..
4. Quadratic Programming Problem
A quadratic programming problem is a nonlinear
programming problem with a quadratic objective function
and linear constraints.
General Form
Page 17
…Contd..
Example: A manufacturing firm
Let the design variables be the number of units of
products A and B manufactured per day:
Page 18
…Contd..
Classification Based on the Number of Objective Functions
1. Single Objective Programming Problem
It has a single objective function irrespective of the
constraints.
General Form
Page 19
…Contd..
2. Multiobjective Programming Problem
It has a multiple objective function irrespective of the
constraints.
General Form
Page 20
…Contd..
Example: Water tank on a column
Let x1 = b and x2 = d denote the cross-sectional
dimensions of the column. The mass of the column (m) is
given by:
The natural frequency of transverse vibration of the
water tank (ω) given by:
Page 21
SOLUTION OF OPTIMIZATION PROBLEMS USING MATLAB
Page 22
…Contd..
Common Matlab Functions
Page 23
Assignment
Using Matlab find the value of the design variables and
the optimum functional value for the following examples in
the book named “Engineering Optimization: Theory and
Practice”, Fourth Edition .
Example: 1.1, 1.3, 1.4, 1.5, 1.6 and 1.10.
Page 24
Thank You!
Page 25