title
  

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

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
155Kb

Official URL: http://dx.doi.org/10.1016/j.ejor.2006.04.012

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)
ID Code:177
Deposited By:Ş. İlker Birbil
Deposited On:19 Dec 2006 02:00
Last Modified:04 Sep 2019 16:30

Repository Staff Only: item control page