Consider the following convex programming problem:
Maximize f(x) = 24x1 – x21 + 10x2 – x22,
Subject to
x1 ≤ 10,
x2 ≤ 15, and
x1 ≥ 0, x2 ≥ 0.