Operations Management

Consider the following linearly constrained convex programming problem: Maximize f(x) = 32x, + 50x2 - 10x3 + x - x - x. subject to 3x, + x2 S II, 2x, + 5x2 5 16, x), X2 2 0. Ignore the constraints and solve the resulting two one-variable unconstrained optimization problems. Use calculus to solve the problem involving x, and use the one-dimensional search procedure with = 0.005 and initial bounds 0 and 4 to solve the problem involving X2. Show that the resulting solution satisfies the constraints