Skip to content

Latest commit

 

History

History
25 lines (17 loc) · 492 Bytes

2019-64.md

File metadata and controls

25 lines (17 loc) · 492 Bytes
course course_year question_number tags title year
Optimization
IB
64
IB
2019
Optimization
Paper 2, Section I, H
2019

State the Lagrange sufficiency theorem.

Find the maximum of $\log (x y z)$ over $x, y, z>0$ subject to the constraint

$$x^{2}+y^{2}+z^{2}=1$$

using Lagrange multipliers. Carefully justify why your solution is in fact the maximum.

Find the maximum of $\log (x y z)$ over $x, y, z>0$ subject to the constraint

$$x^{2}+y^{2}+z^{2} \leqslant 1$$