Solve the following constrained geometric programming problems: Minimize x2 + y subject to the constraint x + x51. where x>0, y>0, z>0. Minimize x2 + y subject to the constraints x + xwsl. y2 + wz 1, where x>0, y>0, z>0, w> 0. (b)