# 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 (x1, x2) = (18, 25) as the initial trial solution.

Maximize

subject to x1 + 2x2 ≤ 110

3x1 + x2 ≤ 120 and 0 ≤ x1 ≤ 36, 0 ≤ x2 ≤ 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

subject to x1 + 2x2 ≤ 110

3x1 + x2 ≤ 120 and 0 ≤ x1 ≤ 36, 0 ≤ x2 ≤ 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.

**View Solution:**## Answer to relevant Questions

For each of the following pairs of parents, generate their two children when applying the basic genetic algorithm presented in Sec. 14.4 to an integer nonlinear programming problem involving only a single variable x, which ...Use your IOR Tutorial to apply the basic algorithm for all three metaheuristics presented in this chapter to the traveling salesman problem described in Prob. 14.2-6. (Use 1-2-3-4-5-6-7- 8-1 as the initial trial solution for ...Read the referenced article that fully describes the OR study summarized in the application vignette presented in Sec. 14.2. Briefly describe how tabu search was applied in this study. Then list the various financial and ...Reconsider Prob. 15.3-2. Use the graphical procedure described in Sec. 15.4 to determine the optimal mixed strategy for each player according to the minimax criterion. Also give the corresponding value of the game. 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