[Solved]Question 6 Consider Following Non Linear Optimisation Problem Minimise 2ar28 75×2 60 4ss5 Q37197666

Question 6 Consider the following non-linear optimisation problem: Minimise: -2Ar28+75×2 – 60 where -4ss5. Suppose that an annealing algorithm is used to solve this problem. Consider the neighbourhood of a solution r as the set of values r+h: -0,5 h0,5 A neighbour of r will be generated by finding a random value for h between -0,5 and 0,5 with r+h 5 and then taking the new solution as r +h Use the cooling schedule a(t) 0, 8t and increase the number of iterations n by 1 for each new value of t. Start with the following initial values and do 2 iterations: t = 1000; current solution F 0; current value = 0 and n = 1. Recall that in case the new solution is worse than the previous one, we generate a random number q and test whether q < e-difference/t Use the following sequence of random h and random q in your answer: h1-0, 265 h2-0,158hs–0,342 J1-0.458 | q2= 0.617 | g3 0,813 Work to 3 decimal places. If the new solution is better, ignore the corresponding g) Show transcribed image text Question 6 Consider the following non-linear optimisation problem: Minimise: -2Ar28+75×2 – 60 where -4ss5. Suppose that an annealing algorithm is used to solve this problem. Consider the neighbourhood of a solution r as the set of values r+h: -0,5 h0,5 A neighbour of r will be generated by finding a random value for h between -0,5 and 0,5 with r+h 5 and then taking the new solution as r +h Use the cooling schedule a(t) 0, 8t and increase the number of iterations n by 1 for each new value of t. Start with the following initial values and do 2 iterations: t = 1000; current solution F 0; current value = 0 and n = 1. Recall that in case the new solution is worse than the previous one, we generate a random number q and test whether q

Expert Answer

---

Answer to Question 6 Consider the following non-linear optimisation problem: Minimise: -2Ar28+75×2 – 60 where -4ss5. Suppose that … . . .