Consider the following nonlinear programming problem.
Maximize Z = x1 (1 – x2) x3,
Subject to
x1 – x2 + x3 ≤ 1
and
x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.
Use dynamic programming to solve this problem.