# Question: Follow the instructions of Prob 14 3 8 for the following nonconvex

Follow the instructions of Prob. 14.3-8 for the following nonconvex programming problem when starting with x = 25 as the initial trial solution.

Maximize f(x) = x6 - 136x5 + 6800x4 - 155,000x3 + 1,570,000x2 - 5,000,000x,

subject to 0 ≤ x ≤ 50.

(a) Using x = 2.5 as the initial trial solution, perform the first iteration of the basic simulated annealing algorithm presented in Sec. 14.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.

(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.

Maximize f(x) = x6 - 136x5 + 6800x4 - 155,000x3 + 1,570,000x2 - 5,000,000x,

subject to 0 ≤ x ≤ 50.

(a) Using x = 2.5 as the initial trial solution, perform the first iteration of the basic simulated annealing algorithm presented in Sec. 14.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.

(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.

## Answer to relevant Questions

Follow the instructions of Prob. 14.3-8 for the following nonconvex programming problem when starting with (x1, x2) = (18, 25) as the initial trial solution. Maximize subject to x1 + 2x2 ≤ 110 3x1 + x2 ≤ 120 and 0 ≤ ...Reconsider the traveling salesman problem shown in Prob. 14.1-1. (a) Perform the initialization step and the first iteration of the basic genetic algorithm presented in Sec. 14.4 by hand. Follow the instructions given at the ...Consider the 10-city traveling salesman problem whose links have the associated distances shown in the following table. Consider the odds and evens game introduced in Sec. 15.1 and whose payoff table is shown in Table 15.1. Use the graphical procedure described in Sec. 15.4 from the viewpoint of player 1 (the evens player) to determine the ...Follow the instructions of Prob. 15.5-3 for the game having the following payoff table: (a) Use the approach described in Sec. 15.5 to formulate the problem of finding optimal mixed strategies according to the minimax ...Post your question