Consider the example of a nonconvex programming problem presented in Sec. 12.10 and depicted in Fig. 12.18.

(a) Using x
2.5 as the initial trial solution, perform the first iteration of the basic simulated annealing algorithm presented in Sec. 13.3 by hand. Follow the instructions given at the beginning of the Problems section to obtain the random numbers. Show your work, including the use of the random numbers.

A

(b) Use your IOR Tutorial to apply this algorithm, starting with x
2.5 as the initial trial solution. Observe the progress of the algorithm and record for each iteration how many (if any) candidates to be the next trial solution are rejected before one is accepted. Also count the number of iterations where a nonimproving move is accepted.