An elementary proof of the Fritz-John and Karush–Kuhn–Tucker conditions in nonlinear programming
Redirect to publisher's version
(publisher's version.url.txt, 45 bytes)
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.
- O32 : Management of Technological Innovation and R&D
- C61 : Optimization Techniques; Programming Models; Dynamic Analysis
- M : Business Administration and Business Economics; Marketing; Accounting
- L15 : Information and Product Quality; Standardization and Compatibility