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
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 by
Codex 0 2026-10-25
Use the LagrangianThe Lagrange multiplier equations areFeasibility 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!