# Question

Consider the following nonconvex programming problem.

Maximize f(x) = x3 – 60x2 + 900x + 100,

subject to 0 ≤ x ≤ 31.

(a) Use the first and second derivatives of f(x) to determine the critical points (along with the end points of the feasible region) where x is either a local maximum or a local minimum.

(b) Roughly plot the graph of f(x) by hand over the feasible region.

Maximize f(x) = x3 – 60x2 + 900x + 100,

subject to 0 ≤ x ≤ 31.

(a) Use the first and second derivatives of f(x) to determine the critical points (along with the end points of the feasible region) where x is either a local maximum or a local minimum.

(b) Roughly plot the graph of f(x) by hand over the feasible region.

## Answer to relevant Questions

Consider the example of a nonconvex programming problem presented in Sec. 13.10 and depicted in Fig. 13.18. Reconsider the nonconvex programming problem shown in Prob. 14.3-7. Suppose now that the variable x is restricted to be an integer. (a) Perform the initialization step and the first iteration of the basic genetic algorithm ...Reconsider the traveling salesman problem shown in Prob. 14.1-1. Starting with 1-2-4-3-5-1 as the initial trial solution, apply the basic tabu search algorithm by hand to this problem. Consider the odds and evens game introduced in Sec. 15.1 and whose payoff table is shown in Table 15.1. (a) Show that this game does not have a saddle point. (b) Write an expression for the expected payoff for player 1 (the ...Refer to the last paragraph of Sec. 15.5. Suppose that 3 were added to all the entries of Table 15.6 to ensure that the corresponding linear programming models for both players have feasible solutions with x3 ≥ 0 and y4 ...Post your question

0