An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming

Warning The system is temporarily closed to updates for reporting purpose.

Birbil, Ş. İlker and Frenk, J. B. G. and Still, G. J. (2007) An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming. European Journal of Operational Research, 180 (1). pp. 479-484. ISSN 0377-2217

[thumbnail of 3011800000548.pdf] PDF
3011800000548.pdf

Download (159kB)

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.
Item Type: Article
Uncontrolled Keywords: nonlinear programming; Fritz-John conditions; Karush-Kuhn-Tucker conditions
Subjects: T Technology > T Technology (General)
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Ş. İlker Birbil
Date Deposited: 19 Dec 2006 02:00
Last Modified: 04 Sep 2019 16:30
URI: https://research.sabanciuniv.edu/id/eprint/177

Actions (login required)

View Item
View Item