OPTIMISATION TECHNIQUES

x = xi, i = 1, n ‘n’ Design Variables

f(x) Objective function

ui < xi < li, i = 1,n Bounds on Design variables

gk(x) = 0, k = 1,m ‘m’ constraints

Trivial Solution Exhaustive Search

Initial Point Trial Point

Deterministic Methods Direct mathematical link

Stochastic Methods Element of randomness

Previous slide

Next slide

Back to first slide

View graphic version