In this note we give an elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions for nonlinear finite dimensional programming problems with equality and/or inequality constraints.The proof avoids the implicit function theorem usually applied when dealing with equality constraints and uses a generalization ofFarkas lemma and the Bolzano-Weierstrass property for compact sets.Fritz-John conditions;Karush-Kuhn-Tucker conditions;nonlinear programming
AbstractFirst-order stationary-point necessary optimality criteria of both the Fritz John and Kuhn-T...
Linear approximation and linear programming duality theory are used as unifying tools to develop sad...
AbstractCraven [1] established the weak duality and the strong duality for a nonlinear fractional pr...
In this note we give an elementary proof of the Fritz-John and Karush–Kuhn–Tucker conditions for non...
In this paper we analyse the Fritz John and Karush-Kuhn-Tucker conditions for a (Gateaux) differe...
9 pagesWe establish new results of first-order necessary conditions of optimality for finite-dimensi...
A Fritz John type dual for a nondifferentiable continuous programming problem with equality and ineq...
AbstractA second-order dual to a nonlinear programming problem is formulated. This dual uses the Fri...
The main purpose of this paper is to extend the John theorem on nonlinear programming with inequalit...
AbstractIn nonlinear programming, invexity is sufficient for optimality (in conjunction with the Kuh...
In this paper the issue of mathematical programming and optimization has being revisited. The theory...
AbstractIn this paper we have obtained Fritz-John type necessary optimality criteria for non-linear ...
In this paper we prove a theorem which gives necessary and sufficient conditions which guarantee the...
AbstractIt is pointed out that Type 1 invex functions are the most general class of functions releva...
2010-2011 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe
AbstractFirst-order stationary-point necessary optimality criteria of both the Fritz John and Kuhn-T...
Linear approximation and linear programming duality theory are used as unifying tools to develop sad...
AbstractCraven [1] established the weak duality and the strong duality for a nonlinear fractional pr...
In this note we give an elementary proof of the Fritz-John and Karush–Kuhn–Tucker conditions for non...
In this paper we analyse the Fritz John and Karush-Kuhn-Tucker conditions for a (Gateaux) differe...
9 pagesWe establish new results of first-order necessary conditions of optimality for finite-dimensi...
A Fritz John type dual for a nondifferentiable continuous programming problem with equality and ineq...
AbstractA second-order dual to a nonlinear programming problem is formulated. This dual uses the Fri...
The main purpose of this paper is to extend the John theorem on nonlinear programming with inequalit...
AbstractIn nonlinear programming, invexity is sufficient for optimality (in conjunction with the Kuh...
In this paper the issue of mathematical programming and optimization has being revisited. The theory...
AbstractIn this paper we have obtained Fritz-John type necessary optimality criteria for non-linear ...
In this paper we prove a theorem which gives necessary and sufficient conditions which guarantee the...
AbstractIt is pointed out that Type 1 invex functions are the most general class of functions releva...
2010-2011 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe
AbstractFirst-order stationary-point necessary optimality criteria of both the Fritz John and Kuhn-T...
Linear approximation and linear programming duality theory are used as unifying tools to develop sad...
AbstractCraven [1] established the weak duality and the strong duality for a nonlinear fractional pr...