In some optimization problems with inequality constraints some of the aforementioned constraints can be x>=0 , y>=0 and so on. I think these constraints are called non negativity constraints; they just state that some of the variables of the objective function aren't negative. When I apply the Khun-Tucker method I don't consider as much multipliers as inequality constraints; for example, in the problem max: xy+9x subject to x+4y<=20 and x>=0 and y>=0 , I construct the lagrangian function as this:
L=xy+9x+λ(20-x-4y)
and then I discard all the negative values that I find for x and y. The issue is that somebody told me that this is the correct way to construct the lagrangian function:
L=xy+9x+λ(20-x-4y)+μ(x)+m(y)
and, supposedly, the values for x and y that are found by analyzing each of those lagrangian functions are not the same; the correct ones would be those that are found by analyzing the second function. I'm not sure if that's right.
Also, is it possible for a critical point of a concave function to be a saddle point?