The Optimization Algorithm is the procedire which is executed iteratively by comparing various solutions
till the optimum or a satisfactory solution is found
It contains the following four tasks:
Design-varible
constraint
objective-function
Varible-bound
After the above four tasks are completed,the optimization problem can be mathematically written in
a special format,know as Non-Liniar programing(NLP)format.
Denoting the design varibles as a column vector x=(x1,x2,x3,....,xN)T,
the objective function as a scalar quantity f(x),j inequality constraints as gj(x)=>0,
and K equality constraints as hk(x)=0,we write the NLP problem:
Minimize f(x)
subject to:
gj(x)=>0, j=1,2,....,J;
hk(x)=0, k=1,2,....,K;
xi(L) <= xi <= xi(U), i=1,2,....,N.
previous