The Kuhn-Tucker Theorem in Concave Programming

In order to solve problems of constrained extrema, it is customary in the calculus to use the method of the Lagrangian multiplier. Let us, for example, consider a problem: maximize f(x1,•••, xn) subject to the restrictions g(x1,•••, xn)=0 (k=1, • ••,m).