Solution
ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2022/discrete-mathematics-continuous-mathematics-and-probability/continuous-mathematics/6/c/solution
Past exam of the year 1 of the computer science course of the University of Oxford 2022 Discrete mathematics, continuous mathematics, and probability Continuous mathematics 6 c Solution by
Codex 0 2026-10-25
For the equality-constrained minimization problem, and . Put . The restricted objective isThe only zero has , so . Since , the second-derivative criterion for convexity proves a unique minimizing . Consequently the equality constraint has minimizers and , with minimum .
For the inequality-constrained minimization problem, the identity supplies the universal lower bound . Both equality points for that bound, and , satisfy . Hence the inequality constraint has exactly these two minimizers, with minimum .
New to topics? Read the docs here!