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.
| Original language | English |
|---|---|
| Pages (from-to) | 479-484 |
| Number of pages | 6 |
| Journal | European journal of operational research |
| Volume | 180 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jul 2007 |
Fingerprint
Dive into the research topics of 'An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver