IDEAS home Printed from
   My bibliography  Save this article

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


  • Brinkhuis, Jan


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.

Suggested Citation

  • Brinkhuis, Jan, 2009. "A linear programming proof of the second order conditions of non-linear programming," European Journal of Operational Research, Elsevier, vol. 192(3), pages 1001-1007, February.
  • Handle: RePEc:eee:ejores:v:192:y:2009:i:3:p:1001-1007

    Download full text from publisher

    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    1. Birbil, S.I. & Frenk, J.B.G. & Still, G.J., 2007. "An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming," European Journal of Operational Research, Elsevier, vol. 180(1), pages 479-484, July.
    Full references (including those not matched with items on IDEAS)


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:192:y:2009:i:3:p:1001-1007. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.