An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming
From MaRDI portal
Publication:869202
DOI10.1016/J.EJOR.2006.04.012zbMath1114.90146OpenAlexW2100456241MaRDI QIDQ869202
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
Related Items (6)
A short elementary proof of the Lagrange multiplier theorem ⋮ Fritz John necessary optimality conditions of the alternative-type ⋮ A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization ⋮ On the multiplier rules ⋮ A smooth proximity measure for optimality in multi-objective optimization using Benson's method ⋮ A linear programming proof of the second order conditions of non-linear programming
Cites Work
This page was built for publication: An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming
