# Question: Consider the following convex programming problem Maximize f x x1x2

Consider the following convex programming problem:

Maximize f (x) = x1x2 – x1 – x12 – x2 – x22,

subject to

x2 ≥ 0.

Maximize f (x) = x1x2 – x1 – x12 – x2 – x22,

subject to

x2 ≥ 0.

## Answer to relevant Questions

Reconsider the quadratic programming model given in Prob. 13.7-4. Beginning with the initial trial solution (x1, x2) = (1/2, 1/2), use the automatic procedure in your IOR Tutorial to apply SUMT to this model with r = 1, ...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, ...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 example of a nonconvex programming problem presented in Sec. 13.10 and depicted in Fig. 13.18. 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-7. (Use 1-2-3-4-5-6-7-8- 9-10-1 as the initial trial ...Post your question