# Question: Consider the following nonconvex programming problem Maximize Profit x5

Consider the following nonconvex programming problem:

Maximize Profit = x5 – 13x4 + 59x3 – 107x2 + 61x,

subject to 0 ≤ x ≥ 5.

(a) Formulate this problem in a spreadsheet, and then use the GRG Nonlinear solving method with the Multistart option to solve this problem.

(b) Use Evolutionary Solver to solve this problem.

Maximize Profit = x5 – 13x4 + 59x3 – 107x2 + 61x,

subject to 0 ≤ x ≥ 5.

(a) Formulate this problem in a spreadsheet, and then use the GRG Nonlinear solving method with the Multistart option to solve this problem.

(b) Use Evolutionary Solver to solve this problem.

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

Consider the following nonconvex programming problem: Maximize Profit = 100x6 – 1,359x5 + 6,836x4 – 15,670x3 + 15,870x2 – 5,095x, subject to 0 ≤ x ≤ 5. (a) Formulate this problem in a spreadsheet, and then use the ...Ever since the day she took her first economics class in high school, Lydia wondered about the financial practices of her parents. They worked very hard to earn enough money to live a comfortable middle-class life, but they ...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 ...Reconsider the traveling salesman problem shown in Prob. 14.1-1. (a) Perform the initialization step and the first iteration of the basic genetic algorithm presented in Sec. 14.4 by hand. Follow the instructions given at the ...Consider the minimum spanning tree problem depicted below, where the dashed lines represent the potential links that could be inserted into the network and the number next to each dashed line represents the cost associated ...Post your question