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

DOI10.1016/J.EJOR.2006.04.012zbMATH Open1114.90146OpenAlexW2100456241MaRDI QIDQ869202FDOQ869202

Authors: N. E. Zubov 

Publication date: 26 February 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.04.012

Recommendations

• An elementary proof of the Karush-Kuhn-Tucker theorem in normed linear spaces for problems with a finite number of inequality constraints
• scientific article; zbMATH DE number 3952509
• Elementary proof of classical necessary optimality conditions for a mathematical programming problem with inequality constraints
• A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization
• A new proof of the Kuhn-Tucker and Farkas theorems

zbMATH Keywords

nonlinear programmingKarush-Kuhn-Tucker conditionsFritz-John conditions

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized concavity
• Title not available (Why is that?)
• The Lagrange Multiplier Rule
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization
• Elementary proof of classical necessary optimality conditions for a mathematical programming problem with inequality constraints
• Title not available (Why is that?)
• Fritz John necessary optimality conditions of the alternative-type
• A linear programming proof of the second order conditions of non-linear programming
• The Avriel-Ben-Tal algebraic operations approach for a short version proof of the Karush-Kuhn-Tucker optimality conditions
• A short elementary proof of the Lagrange multiplier theorem
• An elementary proof of the Karush-Kuhn-Tucker theorem in normed linear spaces for problems with a finite number of inequality constraints
• A smooth proximity measure for optimality in multi-objective optimization using Benson's method
• On the multiplier rules
• New perspective on the Kuhn-Tucker theorem

This page was built for publication: An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869202)