# Question: Consider the following nonconvex programming problem Minimize f x sin

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, what would be the unconstrained function P(x; r) to be minimized at each iteration?

(b) Describe how SUMT should be applied to attempt to obtain a global minimum. (Do not actually solve.)

(c) Use the global optimizer feature of LINGO to solve this problem.

(d) Use MPL and its global optimizer LGO to solve this 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, what would be the unconstrained function P(x; r) to be minimized at each iteration?

(b) Describe how SUMT should be applied to attempt to obtain a global minimum. (Do not actually solve.)

(c) Use the global optimizer feature of LINGO to solve this problem.

(d) Use MPL and its global optimizer LGO to solve this problem.

## Answer to relevant Questions

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 ...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 ...Reconsider the traveling salesman problem shown in Prob. 14.1-1. Using 1-2-3-4-5-1 as the initial trial solution, you are to follow the instructions below for applying the basic simulated annealing algorithm presented in ...Reconsider the example of a traveling salesman problem shown in Fig. 14.4. (a) When the sub-tour reversal algorithm was applied to this problem in Sec. 14.1, the first iteration resulted in a tie for which of two sub-tour ...Read the referenced article that fully describes the OR study summarized in the application vignette presented in Sec. 14.2. Briefly describe how tabu search was applied in this study. Then list the various financial and ...Post your question