Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
477812 | European Journal of Operational Research | 2007 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Ş.İ. Birbil, J.B.G. Frenk, G.J. Still,