# Question

Consider the following linearly constrained optimization problem:

Maximize f(x) = In (x1 + 1) – x22,

Subject to

x1 + 2x2 ≤ 3 and

x1 ≥ 0, x2 ≥ 0.

where In denotes the natural logarithm,

(a) Verify that this problem is a convex programming problem.

Maximize f(x) = In (x1 + 1) – x22,

Subject to

x1 + 2x2 ≤ 3 and

x1 ≥ 0, x2 ≥ 0.

where In denotes the natural logarithm,

(a) Verify that this problem is a convex programming problem.

## Answer to relevant Questions

Consider the nonlinear programming problem given in Prob. 11.3-11. Determine whether (x1, x2) = (1, 2) can be optimal by applying the KKT conditions. Consider the following nonlinear programming problem: Minimize Z = 2x1 + x22, subject to x1 + x2 = 10 and x1 ≥ 0, x2 ≥ 0. (a) Of the special types of nonlinear programming problems described in Sec. 13.3, to which type ...Consider the following function: f (x) = 48x – 60x2 + x3. (a) Use the first and second derivatives to find the local maxima and local minima of f (x). (b) Use the first and second derivatives to show that f (x) has neither ...The MFG Corporation is planning to produce and market three different products. Let x1, x2, and x3 denote the number of units of the three respective products to be produced. The preliminary estimates of their potential ...Consider the following convex programming problem: Maximize Z = 32x1 – x41 + 4x2 – x22, Subject to x21 + x22 ≤ 9 and x1 ≥ 0, x2 ≥ 0. (a) Apply the separable programming technique discussed at the end of Sec. 13.8, ...Post your question

0