A linear programming proof of the second order conditions of nonlinear programming

Jan Brinkhuis

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)

Abstract

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 on the duality theorem for linear programming; the proofs in the literature are based on results of mathematical analysis. This paper completes the work in a recent note of Birbil et al. where a linear programming proof of the first order necessary conditions has been given, using relaxation of equality constraints.
Original languageEnglish
Pages (from-to)1001-1007
Number of pages7
JournalEuropean Journal of Operational Research
Volume192
Issue number3
DOIs
Publication statusPublished - 2009

Research programs

  • EUR ESE 31

Fingerprint

Dive into the research topics of 'A linear programming proof of the second order conditions of nonlinear programming'. Together they form a unique fingerprint.

Cite this