# Question: Consider the following geometric programming problem Minimize f x 2x1 2x2 1

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 problem.

(b) Use the test given in Appendix 2 to verify that the model formulated in part (a) is indeed a convex 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 problem.

(b) Use the test given in Appendix 2 to verify that the model formulated in part (a) is indeed a convex programming problem.

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

Consider the following linear fractional programming problem: Maximize Subject to and x1 ≥ 0, x2 ≥ 0. (a) Transform this problem to an equivalent linear programming problem. 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 = ...Starting from the initial trial solution (x1, x2) = (0, 0), interactively apply the gradient search procedure with ϵ = 0.3 to obtain an approximate solution for the following problem, and then apply the automatic routine ...Reconsider the model given in Prob. 13.3-3. What are the KKT conditions for this model? Use these conditions to determine whether (x1, x2) = (0, 10) can be optimal. Consider the following linearly constrained programming problem: Minimize f(x) = x31 + 4x22 + 16x3, subject to x1 + x2 + x3 = 5 and x1 ≥ 1, x2 ≥ 1, x3 ≥ 1. (a) Convert this problem to an equivalent nonlinear ...Post your question