Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $F, g$ be a polynomias in $n$ variables and consider the optimization task $\min F(x) s.t. g(x)=0$ . In Order to solve this with the Lagrange method, one has to find a multipliers. Can one say anything on the dependency of t he multipliers on the coefficients of the polynomials?

share|cite|improve this question
There is only one constraint, thus, only one multiplier. – Khue Jul 2 '14 at 14:18
Well In case g has singular points one needs to be a bit more careful – Ben Jul 2 '14 at 14:21

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.