A Class of G-Semipreinvex Functions and Optimality
نویسندگان
چکیده
A class of G-semipreinvex functions, which are some generalizations of the semipreinvex functions, and theG-convex functions, is introduced. Examples are given to show their relations among G-semipreinvex functions, semipreinvex functions and G-convex functions. Some characterizations of G-semipreinvex functions are also obtained, and some optimality results are given for a class of G-semipreinvex functions. Ours results improve and generalize some known results.
منابع مشابه
New Optimality Conditions for a Nondifferentiable Fractional Semipreinvex Programming Problem
In recent years, there has been an increasing interest in studying the develpoment of optimality conditions for nondifferentiable multiobjective programming problems. Many authors established and employed some different Kuhn and Tucker type necessary conditions or other type necessary conditions to research optimal solutions; see [1–27] and references therein. In [7], Lai and Ho used the Pareto...
متن کاملC-Class Functions and Remarks on Fixed Points of Weakly Compatible Mappings in G-Metric Spaces Satisfying Common Limit Range Property
In this paper, using the contexts of C-class functions and common limitrange property, common fixed point result for some operator are obtained.Our results generalize several results in the existing literature. Some examplesare given to illustrate the usability of our approach.
متن کاملOptimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملA new subclass of harmonic mappings with positive coefficients
Complex-valued harmonic functions that are univalent and sense-preserving in the open unit disk $U$ can be written as form $f =h+bar{g}$, where $h$ and $g$ are analytic in $U$. In this paper, we introduce the class $S_H^1(beta)$, where $1<betaleq 2$, and consisting of harmonic univalent function $f = h+bar{g}$, where $h$ and $g$ are in the form $h(z) = z+sumlimits_{n=2}^inf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Applied Mathematics
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012