# Question

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.

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.

## Answer to relevant Questions

Consider the following convex programming problem: Maximize Z = 32x1 – x41 + 4x2 – x22, Subject to x21 + x22 ≤ 9 and x1 ≥ 0, x2 ≥ 0. (a) Apply the separable programming technique discussed at the end of Sec. 13.8, ...For each of the following functions, use the test given in Appendix 2 to determine whether it is convex, concave, or neither. (a) f (x) = x1x2 – x21 – x22 (b) f (x) = 3x1 + 2x21 + 4x2 + x22 – 2x1x2 (c) f (x) = x21 + ...Reconsider the linearly constrained convex programming model given in Prob. 13.9-8. (a) If SUMT were to be applied to this problem, what would be the unconstrained function P(x; r) to be maximized at each iteration? Reconsider the first quadratic programming variation of the Wyndor Glass Co. problem presented in Sec. 13.2 (see Fig. 13.6). Beginning with the initial trial solution (x1, x2) = (2, 3), use the automatic procedure in your ...Reconsider the Wyndor Glass Co. problem introduced in Sec. 3.1. (a) Solve this problem using Solver.Post your question

0