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

DOI10.1134/S1064562409020252zbMath1180.49020OpenAlexW2170699311MaRDI QIDQ735840

Alexey 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

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) Duality theory (optimization) (49N15) Optimality conditions for problems involving ordinary differential equations (49K15)

Related Items (2)

pth-order approximation of the solution set of nonlinear equations ⋮ Elementary proof of constructive versions of the tangent direction theorem and the implicit function theorem

Cites Work

• On the Development of Optimization Theory
• Unnamed Item
• Unnamed Item

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