Convexity and generalized convexity play important roles in optimization theory. With the development of programming problem, there has been a growing interest in the higher-order dual problem and a lot of related generalized convexities are given. In this paper, we give the convexity of ( , , , , , ) F d b     vector-pseudoquasi-Type I and formulate a higher-order duality for minimax fract...

In this paper, an extension of the generalized data envelopment analysis (GDEA) model has been introduced. In this generalization different cases of production possibility set (PPS) of the extended generalized data envelopment analysis (EGDEA) model are investigated. The proposed EGDEA model is used to evaluate decision’s making units (DMUs) either with full convexity assumption imposed on inpu...

We introduce, in the first part, the notion of weakly convex pair of correspondences, we give its economic interpretation, we state a fixed point and a selection theorem. Then, by using a tehnique based on a continuous selection, we prove existence theorems of quilibrium for an abstract economy. In the second part, we define the weakly biconvex correspondences, we prove a selection theorem and ...

The aim of this paper is to deal with a class of multiobjective semi-infinite programming problem. For such problem, several necessary optimality conditions are established and proved using the powerful tool of K − subdifferential and the generalized convexity namely generalized uniform ( , , , ) K F d α ρ − − convexity. We also formulate the Wolf type dual models for the semi-infinite programm...

We study nonsmooth multiobjective programming problems involving locally Lipschitz functions and support functions. Two types of Karush-Kuhn-Tucker optimality conditions with support functions are introduced. Sufficient optimality conditions are presented by using generalized convexity and certain regularity conditions. We formulate Wolfe-type dual and Mond-Weirtype dual problems for our nonsmo...

Correspondence: gaoyingimu@163. com Department of Mathematics, Chongqing Normal University, Chongqing 400047, China Abstract In this paper, a pair of nondifferentiable multiobjective fractional programming problems is formulated. For a differentiable function, we introduce the definition of higher-order (F, a, r, d)-convexity, which extends some kinds of generalized convexity, such as second or...

In this paper, we consider a very useful and significant class of convex sets and convex functions that is relative convex sets and relative convex functions which was introduced and studied by Noor [20]. Several new inequalities of Hermite-Hadamard type for relative convex functions are established using different approaches. We also introduce relative h-convex functions and is shown that rela...

Making use of generalized integral operator, we define a subclass of analytic functions with negative coefficients. The main object of this paper is to obtain coefficient estimates, closure theorems and extreme points. Also we obtain radii of close-to-convexity, starlikeness and convexity and neighbourhood results for functions in the generalized classR∗(α, β, μ, η). 2000 Mathematics Subject Cl...

Convexity spaces defined in the paper are generated by families of continuous functions. Without imposing any explicitly stated linear structure on the spaces, Browder’s, Brouwer’s and Kakutani’s fixed point theorems are proved and used for deriving generalized Fan inequalities and two-function minimax theorems. The existence of Nash equilibria in noncooperative games is also established under ...

The generalized divided differences are introduced. They are applied to investigate some properties characterizing generalized higher-order convexity. Among others some support-type property is proved.