Question

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.


$1.99
Sales0
Views29
Comments0
  • CreatedSeptember 22, 2015
  • Files Included
Post your question
5000