
40 Optimization: Algorithms and Applications
On executing the code for the test problem, the output obtained is
a b
-------------------------
40.000 90.000
40.000 65.000
52.500 65.000
52.500 58.750
52.500 55.625
54.063 55.625
54.844 55.625
54.844 55.234
55.039 55.234
55.039 55.137
55.039 55.088
55.063 55.088
55.076 55.088
-------------------------
x* = 55.082 Minimum = 1225.166
Number of function calls = 52
The minimum obtained from this method matches very closely with the
exhaustive search method. But the number of function evaluations in the
bisection method is only 52 as compared to 5000 in the exhaustive search
method. For th ...