An Elementary Proof of the Fritz-John and Karush-Kuhn-Tucker Conditions in Nonlinear Programming
AbstractIn 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam. in its series Research Paper with number ERS-2005-057-LIS.
Date of creation: 14 Oct 2005
Date of revision:
Contact details of provider:
Web page: http://www.erim.eur.nl/
Fritz-John conditions; Karush-Kuhn-Tucker conditions; nonlinear programming;
This paper has been announced in the following NEP Reports:
- NEP-ALL-2005-10-29 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statistics
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (ERIM Series Handler at the ERIM Office).
If references are entirely missing, you can add them using this form.