A linear programming proof of the second order conditions of non-linear programming

In this note we give a new, simple proof of the standard first and second order necessary conditions, under the Mangasarian-Fromovitz constraint qualification (MFCQ), for non-linear programming problems. We work under a mild constraint qualification, which is implied by MFCQ. This makes it possible to reduce the proof to the relatively easy case of inequality constraints only under MFCQ. This reduction makes use of relaxation of inequality constraints and it makes use of a penalty function. The new proof is based oil the duality theorem for linear programming; the proofs ill the literature are based oil results of mathematical analysis. This paper completes the work in a recent note of Birbil et ill. where a linear programming proof of the first order necessary conditions has been given, using relaxation of equality constraints. (c) 2007 Elsevier B.V. All rights reserved.