Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2019/discrete-mathematics-continuous-mathematics-and-probability/6/a/solution

Use the Lagrangian
The Lagrange multiplier equations are
Feasibility makes , so . The second equation becomes , forcing and then . The constraint gradient is nonzero on the feasible set, so the multiplier calculation has no missing singular feasible point.
To verify the global minimum rather than just stationarity, eliminate :
Equality holds exactly at or , with minimum value .

New to topics? Read the docs here!