Background
This is a follow-up to this question. The problem statement is the same:
Maximize $$f(\alpha_1, \dots, \alpha_5) = \sum_{1 \le i < j < k \le 5} \alpha_i \alpha_j \alpha_k$$ with the constraints $$0 \le \alpha_1, \dots, \alpha_5 \le 1, \quad\sum_{i=1}^5i\alpha_i=1$$
The authors write
Differentiation yields no interior extreme points, so we conclude $\alpha_5 = 0$ for the optimum.
This is apparently a flawed reasoning according to the nice answers given in the previous question.
Question
Now, the authors continue by finding the values for $\alpha_n$, under the (correct) assumption that $\alpha_5 = 0$. Quote from the paper:
(Differentiation yields no interior extreme points, so we conclude $\alpha_5 = 0$ for the optimum.) Differentiating again, and setting the derivatives to zero, we get the equations $$\begin{align} 0 &= \alpha_3+\alpha_2-8\alpha_4\alpha_3-8\alpha_4\alpha_2-8\alpha_3\alpha_2-3\alpha_3^2-2\alpha_2^2\\ 0 &= \alpha_4+\alpha_2-6\alpha_4\alpha_3-8\alpha_4\alpha_2-6\alpha_3\alpha_2-4\alpha_4^2-2\alpha_2^2\\ 0 &= \alpha_4+\alpha_3-8\alpha_4\alpha_3-4\alpha_4\alpha_2-4\alpha_3\alpha_2-4\alpha_4^2-3\alpha_3^2\\ \alpha_1&=1-\left( 5\alpha_5-4\alpha_4-3\alpha_3-2\alpha_2 \right) \end{align}$$
They then use a CAS to derive quartic equations, to which the $\alpha_n$'s are solutions.
The problem can be solved by use of Lagrange multipliers, which I have done, but that method does not give the same equations. Also, the wording "Differentiating again, ..." seems to rule out the use of Lagrange, doesn't it?
To my question: What method do the authors use to get the equation system shown above?
Now, if say a_1=0, the constrain becomes $2a_2+\cdots+5a_5=1$. We can then replace $a_5$ by $a_1'$ and get the constrain $a_1'+2a_2+3a_3+4a_4=1$, which is the case $a_5=0$ but with smaller $f$.
I believe the author thought that the idea was simple and skipped it.
– Quang Hoang Aug 01 '14 at 15:01