کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
477424 1446159 2009 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A linear programming proof of the second order conditions of non-linear programming
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
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 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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 192, Issue 3, 1 February 2009, Pages 1001–1007
نویسندگان
,