Consider the following nonlinear programming problem.
Maximize Z = 2x21 + 2x2 + 4x3 – x23
Subject to
2x1 + x2 + x3 ≤ 4
and
x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.
Use dynamic programming to solve this problem.