Consider the following convex programming problem:
Maximize f(x) = –2x1 – (x2 – 3)2,
Subject to
x1 ≥ 3 and x2 ≥ 3.
(a) If SUMT were applied to this problem, what would be the unconstrained function P(x; r) to be maximized at each iteration?