3.I.5D3 . \mathrm{I} . 5 \mathrm{D} \quad

Optimization | Part IB, 2001

Let a1,,ana_{1}, \ldots, a_{n} be given constants, not all equal.

Use the Lagrangian sufficiency theorem, which you should state clearly, without proof, to minimize i=1nxi2\sum_{i=1}^{n} x_{i}^{2} subject to the two constraints i=1nxi=1,i=1naixi=0.\sum_{i=1}^{n} x_{i}=1, \sum_{i=1}^{n} a_{i} x_{i}=0 .

Typos? Please submit corrections to this page on GitHub.