# Question

Consider the following nonlinear programming problem:

Minimize Z = x41 + 2x22,

Subject to

x21 + x22 ≥ 2.

(No nonnegativity constraints.)

(a) Use geometric analysis to determine whether the feasible region is a convex set.

(b) Now use algebra and calculus to determine whether the feasible region is a convex set.

Minimize Z = x41 + 2x22,

Subject to

x21 + x22 ≥ 2.

(No nonnegativity constraints.)

(a) Use geometric analysis to determine whether the feasible region is a convex set.

(b) Now use algebra and calculus to determine whether the feasible region is a convex set.

## Answer to relevant Questions

Reconsider Prob. 13.1-2. Verify that this problem is a convex programming problem. Consider the following nonlinear programming problem: Minimize Z = x41 + 2x21 + 2x1 x2 + 4x22, Subject to and x1 ≥ 0, x2 ≥ 0. (a) Of the special types of nonlinear programming problems described in Sec. 13.3, to which ...Consider the following problem: Maximize f(x) = 48x5 + 42x3 + 3.5 x – 16x6 – 61x4 – 16.5x2. (a) Apply the bisection method to (approximately) solve this problem. Use an error tolerance ϵ = 0.08 and initial bounds x = ...For the P & T Co. problem described in Sec. 9.1, suppose that there is a 10 percent discount in the shipping cost for all truckloads beyond the first 40 for each combination of cannery and warehouse. Draw figures like Figs. ...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 ...Post your question

0