# Question

Consider the following convex programming problem:

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

Subject to

x1 ≥ 3 and x2 ≥ 3.

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

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

Subject to

x1 ≥ 3 and x2 ≥ 3.

(a) If SUMT were 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 convex programming problem: Maximize f (x) = x1x2 – x1 – x12 – x2 – x22, subject to x2 ≥ 0. 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; ...Consider the following problem: Maximize Z = 4x1 – x12 + 10x2 – x22, subject to x12 + 4x22 ≤ 16 and x1 ≥ 0, x2 ≥ 0. (a) Is this a convex programming problem? Answer yes or no, and then justify your answer. (b) Can ...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 ...Use your IOR Tutorial to apply the basic algorithm for all three metaheuristics presented in this chapter to the traveling salesman problem described in Prob. 14.2-6. (Use 1-2-3-4-5-6-7- 8-1 as the initial trial solution for ...Post your question

0