An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming [An article from: European Journal of Operational Research] Buy on Amazon
Facebook LinkedIn

An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming [An article from: European Journal of Operational Research]

Price not available for India

You can still browse on Amazon. Try another country above.

Book Details
Publisher Elsevier
ISBN / ASIN B000PDSPTA
ISBN-13 978B000PDSPT2
Marketplace India 🇮🇳
Ratings & Reviews No reviews yet — be the first!

No reviews yet.

Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2007. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
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.
Donate to EbookNetworking
No Prev
No Next