please show iterations in table form. hand written. thank you.

12.3-4. Consider the following geometric programming problem: Minimizef(x)=2x12x21+x22, subject to 4x1x2+x12x2212 and x10,x20. (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. 12.5-1. Consider the following unconstrained optimization problem: Maximize f(x)=2x1x2+x2x122x22. D.I (a) Starting from the initial trial solution (x1,x2)=(1,1), interactively apply the gradient search procedure with =0.25 to obtain an approximate solution. (b) Solve the system of linear equations obtained by setting f(x)=0 to obtain the exact solution. (c) Referring to Fig 12.14 as a sample for a similar problem, draw the path of trial solutions you obtained in part (a). Then show the apparent continuation of this path with your best guess for the next three trial solutions [based on the pattern in part (a) and in Fig. 12.14]. Also show the exact solution from part (b) toward which this sequence of trial solutions is converging. (d) Apply the automatic routine for the gradient search procedure (with =0.01 ) in your IOR Tutorial to this