Consider the following nonlinear programming problem

(first considered in Prob. 11.3-23).

Maximize Z 5x1 x2, subject to 2x1 2 x2 13 x1 2 x2 9 and x1  0, x2  0.

(a) Show that this problem is a convex programming problem.

(b) Use the separable programming technique discussed at the end of Sec. 13.8 to formulate an approximate linear programming model for this problem. Use the integers as the breakpoints of the piecewise linear function.

C

(c) Use the computer to solve the model formulated in part (b).

Then reexpress this solution in terms of the original variables of the problem.