Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2018/discrete-mathematics-continuous-mathematics-and-probability/5/d/solution

Substituting cancels both the cubic and linear terms, leaving for every real . Thus the constrained maximum and minimum are both zero, attained everywhere on the constraint line. The feasible set is unbounded, but the restricted function is constant; compactness is not needed here.

New to topics? Read the docs here!