2014 | OriginalPaper | Chapter
The Kuhn-Tucker Theorem in Concave Programming
Author : Hirofumi Uzawa
Published in: Traces and Emergence of Nonlinear Programming
Publisher: Springer Basel
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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(x
1
,•••, x
n
) subject to the restrictions g(x
1
,•••, x
n
)=0 (k=1, • ••,m).