# Question

Consider the following nonconvex programming problem:

Maximize f(x) = 3x1 x2 – 2x21 – x32,

Subject to

and

x1 ≥ 0, x2 ≥ 0.

(a) If SUMT were to be applied to this problem, what would be the unconstrained function P(x; r) to be maximized at each iteration?

Maximize f(x) = 3x1 x2 – 2x21 – x32,

Subject to

and

x1 ≥ 0, x2 ≥ 0.

(a) If SUMT were to be applied to this problem, what would be the unconstrained function P(x; r) to be maximized at each iteration?

## Answer to relevant Questions

Consider the following nonconvex programming problem: Minimize f (x) = sin 3x1 + cos 3x2 + sin(x1 + x2), subject to x12 – 10x2 ≥ – 1 10x1 + x22 ≤ 100 and x1 ≥ 0, x2 ≥ 0. (a) If SUMT were applied to this problem, ...Reconsider the Wyndor Glass Co. problem introduced in Sec. 3.1. (a) Solve this problem using Solver. While applying a simulated annealing algorithm to a certain problem, you have come to an iteration where the current value of T is T = 2 and the value of the objective function for the current trial solution is 30. This ...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 ...Consider the 10-city traveling salesman problem whose links have the associated distances shown in the following table.Post your question

0