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 GRG Nonlinear solving method with the Multistart option to solve this problem.
(b) Use Evolutionary Solver to solve this problem.