First of all thank you for your time and help. I am more on programming side and have average knowledge of calculus so less formal on mathematical notation. I have encountered a problem in non linear equality constraint optimization
The objective function which has to be minimized $$ ax_1^2 + bx_2^2 + cx_3^2 $$
subject to constraint
$$ \frac {1}{x_1} + \frac {1}{x_2} + \frac {1}{x_3} = T $$
So the Lagrangian is
$$ L(..)=ax_1^2 + bx_2^2 + cx_3^2 + \lambda (\frac {1}{x_1} + \frac {1}{x_2} + \frac {1}{x_3} -T) $$
at times the coefficient c takes the value c = o, which results in
$$ ax_1^2 + bx_2^2 $$
subject to constraint
$$ \frac {1}{x_1} + \frac {1}{x_2} + \frac {1}{x_3} = T $$
So the new Lagrangian is
$$ L_1(..)=ax_1^2 + bx_2^2 + \lambda (\frac {1}{x_1} + \frac {1}{x_2} + \frac {1}{x_3} -T) $$
Question: My understanding is that $L_1$ has no valid analytical solution nor numerical solution. I am looking for concrete theoretical reasons to convince my senior that in case of c=0 the optimization problem is no longer valid minimization problem. Preferably independent of $L_1$, considering only the objective function and constraint. I will appreciate the multiple explanations from the perspective of geometry, calculus e.t.c.

