Consider the following nonlinear programming problem:
Maximize Z = 5x1 + x2,
subject to
2x12 + x2 ≤ 13
x12 + 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.