[PDF] Top 20 Optimality and duality results for E differentiable multiobjective fractional programming problems under E convexity

... tive fractional programming problems with both inequality and equality constraints in which the involved functions are ...considered E-differentiable fractional programming ... See full document

... semilocal E-convexity, studied its some characterizations, and established some optimality conditions and duality results for semilocal E-convex ...[14], optimality and ... See full document

... in fractional vector optimization ...relevant problems to characterize the efficiency and proper efficiency of fractional vector optimization problems ...efficient optimality of differentiable ... See full document

... sufficient optimality conditions and Mond-Weir type duality relations for nonsmooth multiobjective programming ...Our results generalize a variety of previously known results in ... See full document

... for multiobjective fractional variational programs in second order .... Under invexity assumptions , we established weak , strong and converse duality as well as self duality relations ... See full document

... F- convexity defined by Hanson and Mond [5], and generalized ρ-convexity defined by Vial [14], and he used the concept to obtain some duality ...discussed duality for multiobjective ... See full document

... available optimality and duality results for minmax fractional susbset pro- gramming problems was presented, a fairly comprehensive list of references dealing with different aspects of ... See full document

... non-smooth multiobjective semi-infinite programming ...of convexity namely G − ( , ) F θ convexity and Kuhn-Tucker constraint qualification, to prove new duality results for such ... See full document

... type optimality conditions for a nondifferentiable multiobjective variational prob- lem are ...type optimality conditions, Mond-weir type second-order nondifferentiable multiobjective dual ... See full document

... necessary optimality conditions are ...type optimality conditions, Wolfe type dual is formulated and usual duality theorems are estab- lished under generalized convexity ...our ... See full document

... non differentiable multiobjective fractional programming problem in which the numerator of objective function contains square root of positive semi definite quadratic ...sufficient ... See full document

... nonsmooth multiobjective programming problems including support functions with inequality and equality ...sufficient optimality conditions are obtained by using higher-order strong ... See full document

... nonsmooth multiobjective programming problems involving locally Lipschitz functions and support ...Karush-Kuhn-Tucker optimality conditions with support functions are ...Sufficient ... See full document

... second-order duality for nondifferentiable minimax fractional programming under the second-order generalized convexity type ...converse duality theorems are proved. Results ... See full document

... and duality for non- linear programming ...sufficient optimality conditions for nonlinear programming ...and duality for multiobjective programming problems are ... See full document

... sufficient optimality theorems for the multiobjective E-convex programming are established under the weakened assumption of the theorems in Megahed et ...mixed duality for the ... See full document

... the optimality conditions of [1], Tanimoto [2] defined a first-order dual problem of , which gene- ralized the duality theorems for convex minimax pro- gramming problems considered by Weir [3] and ... See full document

... nondifferentiable multiobjective fractional programming problems in which every component of objective functions contains a term involving the support function of a compact convex ... See full document

... of multiobjective programming, also called vector programming, has grown remarkably in different directions in the settings of optimality conditions and duality theory since the ...of ... See full document

... non-differentiable multiobjective nonlinear programming problems where each of the objective functions contains a pair of support ...converse duality theorems are established for the ... See full document