An Elementary Proof of the Fritz-John and Karush-Kuhn-Tucker Conditions in Nonlinear Programming
Lists
Only you see this
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\nFarkas lemma and the Bolzano-Weierstrass property for compact sets.
BibTeX
@article{birbil2007elementary,
author = {Ş. İlker Birbil and J. B. G. Frenk},
title = {{An Elementary Proof of the Fritz-John and Karush-Kuhn-Tucker Conditions in Nonlinear Programming}},
journal = {Eur. J. Oper. Res.},
year = {2007},
doi = {10.1016/j.ejor.2006.04.012},
}Loading related content...