Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2015/iii/paper-38/1/c/solution

For minimization, the optimization Lagrangian is
Its coefficient of is , so its infimum over unrestricted is for every allowable Lagrange multiplier. There is no finite global minimizer of the optimization Lagrangian to which the Lagrangian sufficiency theorem could apply.
The primal minimization problem is also unbounded: set , and . These points are feasible, and . Hence

New to topics? Read the docs here!