# Question: Consider the following nonlinear programming problem Minimize Z x41

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 type or types can this particular problem be fitted? Justify your answer.

(b) Now suppose that the problem is changed slightly by replacing the nonnegativity constraints by x1 ≥ 1 and x2 ≥ 1. Convert this new problem to an equivalent problem that has just two functional constraints, two variables, and two nonnegativity constraints.

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 type or types can this particular problem be fitted? Justify your answer.

(b) Now suppose that the problem is changed slightly by replacing the nonnegativity constraints by x1 ≥ 1 and x2 ≥ 1. Convert this new problem to an equivalent problem that has just two functional constraints, two variables, and two nonnegativity constraints.

**View Solution:**## Answer to relevant Questions

Consider the following geometric programming problem: Minimize f(x) = 2x1–2x2–1 + x2–2, Subject to 4x1x2 + x21x22 ≤ 12 And x1 ≥ 0, x2 ≥ 0. (a) Transform this problem to an equivalent convex programming ...Use the bisection method with an error tolerance ϵ = 0.04 and with the following initial bounds to interactively solve (approximately) each of the following problems. (a) Maximize f(x) = 6x – x2, with x = 0, x-bar = ...Starting from the initial trial solution (x1, x2) = (1, 1), interactively apply two iterations of the gradient search procedure to begin solving the following problem, and then apply the automatic routine for this procedure ...Reconsider Prob. 13.2-9. Use the KKT conditions to check whether (x1, x2) = (1/√2, 1/ √2) is optimal. 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 ...Post your question