answer in the keybook is

7. Using Matlab's built in "fmincon" command, study the common wine bottle function: 2 Where: a2 +b2+3 +sin(ab 2 a 6x1 3 A series of local minimums can be found that will depend on the initial guess supplied to the algorithm. a) Plot the function surface to get an idea of where the local minimums should be (Hint-you will be looking for local minimum rings) b) Solve the optimization problem 1,000 times using random initial guesses and store the results from each iteration c) Plot all 1,000 solutions on a graph with axis of x1 and x2 7. Using Matlab's built in "fmincon" command, study the common wine bottle function: 2 Where: a2 +b2+3 +sin(ab 2 a 6x1 3 A series of local minimums can be found that will depend on the initial guess supplied to the algorithm. a) Plot the function surface to get an idea of where the local minimums should be (Hint-you will be looking for local minimum rings) b) Solve the optimization problem 1,000 times using random initial guesses and store the results from each iteration c) Plot all 1,000 solutions on a graph with axis of x1 and x2