Consider the following geometric programming problem:

Minimize f(x) 2x1

2 x2

1 x2

2

, subject to 4x1x2 x1 2

x2 2 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.