Download This PaperAn Elementary Proof of the Fritz-John and Karush-Kuhn-Tucker Conditions in Nonlinear Programming
12 Pages Posted: 26 Aug 2006
Date Written: 14 2005, 10
Abstract
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: nonlinear programming, Fritz-John conditions, Karush-Kuhn-Tucker conditions
JEL Classification: M, L15, O32, C61
Suggested Citation: Suggested Citation
Birbil, S. Ilker and Frenk, J.B.G. (Hans) and Still, G., An Elementary Proof of the Fritz-John and Karush-Kuhn-Tucker Conditions in Nonlinear Programming (14 2005, 10). ERIM Report Series Reference No. ERS-2005-057-LIS, Available at SSRN: https://ssrn.com/abstract=828179
Erasmus University, Rotterdam (EUR) - Erasmus Research Institute of Management (ERIM)
P.O. Box 1738
3000 DR Rotterdam
Netherlands
Do you have a job opening that you would like to promote on SSRN?
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.
