An elementary proof of the Fritz-John and Karush–Kuhn–Tucker conditions in nonlinear programming


Article
volume 180, issue 1 pp 479-484.
This publication is part of collections
Related Files

(publisher's version.url.txt, 45 bytes)
Repository contains one additional file which is not publicly available

In this note we give an elementary proof of the Fritz-John and Karush–Kuhn–Tucker conditions for nonlinear finite dimensional programming problems with equality and/or inequality constraints. The proof avoids the implicit function theorem usually applied when dealing with equality constraints and uses a generalization of Farkas lemma and the Bolzano-Weierstrass property for compact sets.



Keywords


Classifications using Journal of Economic Literature (JEL) Classification System