Evolution and Optimum Seeking

340 Appendix A
Problem 2.20
Objective function:
Minimum:
Start:
Problem 2.21
Objective function:
Minimum:
Start:
F (x) =
nX
i=1
jxij for n =5
x i =0 for i =1(1)n F (x )=0
x (0)
i =10 for i =1(1)n F (x (0) )=50
F (x) = max
i fjxij i= 1(1)ng for n =5
x i =0 for i =1(1)n F (x )=0
x (0)
i =10 for i =1(1)n F (x (0) )=10
Since the starting point is at a corner of the cubic contour surface, none of the coordinate
strategies could nd a point withalower value of the objective function. The method of
Figure A.13: Graphical representation of Problem 2.20 for n =2
F (x) ==2 4 6 8 10 12 14 16 18 20=