Fritz-john and Kuhn-tucker Conditions in Non-linear Programming
نویسندگان
چکیده
In this paper we give necessary optimality conditions of Fritz-John and Kuhn-Tucker (KKT) conditions for non-linear infinite dimensional programming problem with operatorial constraints. We use an alternative theorem. Some of the known results in finite dimensional case have been extended to infinite dimensional case with suitable conditions.
منابع مشابه
Integrating Goal Programming, Taylor Series, Kuhn-Tucker Conditions, and Penalty Function Approaches to Solve Linear Fractional Bi-level Programming Problems
In this paper, we integrate goal programming (GP), Taylor Series, Kuhn-Tucker conditions and Penalty Function approaches to solve linear fractional bi-level programming (LFBLP)problems. As we know, the Taylor Series is having the property of transforming fractional functions to a polynomial. In the present article by Taylor Series we obtain polynomial objective functions which are equivalent...
متن کاملA TAYLOR SERIES APPROACH FOR SOLVING LINEAR FRACTIONAL DECENTRALIZED BI-LEVEL MULTI-OBJECTIVE DECISION-MAKING UNDER FUZZINESS
This paper presents a Taylor series approach for solving linear fractional de-centralized bi-level multi-objective decision-making (LFDBL-MODM) problems with asingle decision maker at the upper level and multiple decision makers at the lower level.In the proposed approach, the membership functions associated with each objective(s) ofthe level(s) of LFDBL-MODM are transformed by using a Taylor s...
متن کاملAn elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming
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 of Farkas lemma and the Bolzano-Weierstrass property for compact sets. 2006 P...
متن کاملThe Fritz John Necessary Optimality Conditions in the Presence of Equality and Inequality Constraints
Optimality criteria form the foundations of mathematical programming both theoretically and computationally. In general, these criteria can be classified as either necessary or sufficient. Of course, one would like to have the same criterion be both necessary and sufficient. However, this occurs only under somewhat ideal conditions which are rarely satisfied in practice. In the absence of conve...
متن کاملFritz john second-order duality for nonlinear programming
Abstract-A second-order dual to a nonlinear programming problem is formulated. This dual uses the Ritz John necessary optimality conditions instead of the Karush-Kuhn-Tucker necessary optimal&y conditions, and thus, does not require a constraint qualification. Weak, strong, strictconverse, and converse duality theorems between primal and dual problems are established. @ 2001 Elsevier Science Lt...
متن کامل