Elementary proof of classical necessary optimality conditions for a mathematical programming problem with inequality constraints

DOI10.1134/S1064562409020252zbMATH Open1180.49020OpenAlexW2170699311MaRDI QIDQ735840FDOQ735840

Authors: A. Tret'yakov 

Publication date: 26 October 2009

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562409020252

Recommendations

• A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization
• An elementary proof of the Karush-Kuhn-Tucker theorem in normed linear spaces for problems with a finite number of inequality constraints
• An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming
• New perspective on the Kuhn-Tucker theorem
• A Direct Proof of the Kuhn–Tucker Necessary Optimality Theorem for Convex and Affine Inequalities

zbMATH Keywords

necessary optimality conditionsKronecker-Capelli theoremKuhn-Tucker theorem for a constrained optimization problem

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Optimality conditions for problems involving ordinary differential equations (49K15) Duality theory (optimization) (49N15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Development of Optimization Theory

Cited In (8)

• An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming
• Elementary proof of constructive versions of the tangent direction theorem and the implicit function theorem
• A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization
• An elementary proof of an equivalence theorem relevant in the theory of optimization
• pth-order approximation of the solution set of nonlinear equations
• A Direct Proof of the Kuhn–Tucker Necessary Optimality Theorem for Convex and Affine Inequalities
• An elementary proof of the Karush-Kuhn-Tucker theorem in normed linear spaces for problems with a finite number of inequality constraints
• New perspective on the Kuhn-Tucker theorem

This page was built for publication: Elementary proof of classical necessary optimality conditions for a mathematical programming problem with inequality constraints

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