First Note on the Definition of S2-Convexity

In this short, but fundamental, note, we start progressing towards a mathematically sound definition of the real functional classes

Multiobjective Program with Support Functions Under(G, C, ρ)-Convexity Assumptions

This paper deals with multiobjective programming problems with support functions under （G, C, ρ）-convexity assumptions. Not only sufficient but also necessary optimality conditions for this kind of multiobjective programming problems are established from a viewpoint of （G, C, ρ）-convexity. When the sufficient conditions are utilized, the corresponding duality theorems are derived for general Mond-Weir type dual program.

Higher-Order Minimizers and Generalized (F,<i>ρ</i>)-Convexity in Nonsmooth Vector Optimization over Cones

In this paper, we introduce the concept of a (weak) minimizer of order k for a nonsmooth vector optimization problem over cones. Generalized classes of higher-order cone-nonsmooth (F, ρ)-convex functions are introduced and sufficient optimality results are proved involving these classes. Also, a unified dual is associated with the considered primal problem, and weak and strong duality results are established.

Inequalities for Tφ-convex functions

In this paper, the Tφ-convex functions were introduced as a generalizations of convex functions. Then the characteristics of the Tφ-convex functions were discussed. Furthermore, some new inequalities for the Tφ-convex functions were derived.

Almost Fixed Points and Fixed Points of Upper [Lower] Semicontinuous Multimap on Locally G-convex Spaces

In this paper, we use the well known KKM type theorem for generalized convex spaces due to Park （Elements of the KKM theory for generalized convex spaces, Korean J. Comp. Appl. Math., 7（2000）, 1-28） to obtain an almost fixed point theorem for upper [resp., lower] semicontinuous multimaps in locally G-convex spaces, and then give a fixed point theorem for upper semicontinuous multimap with closed Γ-convex values.

L^0-CONVEX COMPACTNESS AND RANDOM NORMAL STRUCTURE IN L^0(F,B)

Let(B,||·||)be a Banach space,(?,F,P)a probability space,and L^0(F,B)the set of equivalence classes of strong random elements(or strongly measurable functions)from(?,F,P)to(B,||·||).It is well known that L^0(F,B)becomes a complete random normed module,which has played an important role in the process of applications of random normed modules to the theory of Lebesgue-Bochner function spaces and random operator theory.Let V be a closed convex subset of B and L^0(F,V)the set of equivalence classes of strong random elements from(?,F,P)to V.The central purpose of this article is to prove the following two results:(1)L^0(F,V)is L^0-convexly compact if and only if V is weakly compact;(2)L^0(F,V)has random normal structure if V is weakly compact and has normal structure.As an application,a general random fixed point theorem for a strong random nonexpansive operator is given,which generalizes and improves several well known results.We hope that our new method,namely skillfully combining measurable selection theorems,the theory of random normed modules,and Banach space techniques,can be applied in the other related aspects.

On Certain Properties of Trigonometrically <i>ρ</i>-Convex Functions

The aim of this paper is to prove that the average function of a trigonometrically ρ-convex function is trigonometrically ρ-convex. Furthermore, we show the existence of support curves implies the trigonometric ρ-convexity, and prove an extremum property of this function.

GENERALIZED MINIMAX INEQUALITIES AND FIXED POINT THEOREMS

Recently many authors have generalized the famous Ky Fan's minimax inequality. In this paper, we put forward T-diagonal convexity (concavity) conditions and develop the main results in this respect. Next, we discuss some fixed point problems, and generalize the Fan-Glicksberg's fixed point theorem[14].

DUALITY FOR MULTIOBJECTIVE FRACTIONAL PROGRAMMING INVOLVING n-SET FUNCTIONS

In this paper, two duality results are established under generalized ρ-convexity conditions for a class of multiobjective fractional programmign involvign differentiable n-sten functions.

Generalized Multiobjective Symmetric Duality under Second-Order(F, α, ρ, d)-Convexity

In this paper, we first formulate a second-order multiobjective symmetric primal-dual pair over arbitrary cones by introducing two different functions f ： R^n × R^m → Rk and g ： R^n × R^m → R^l in each k-objectives as well as l-constraints. Further, appropriate duality relations are established under second-order（F, α, ρ, d）-convexity assumptions. A nontrivial example which is second-order（F, α, ρ, d）-convex but not secondorder convex/F-convex is also illustrated. Moreover, a second-order minimax mixed integer dual programs is formulated and a duality theorem is established using second-order（F, α, ρ, d）-convexity assumptions. A self duality theorem is also obtained by assuming the functions involved to be skew-symmetric.

L~■-convexity and its applications in operations

L■-convexity, one of the central concepts in discrete convex analysis, receives significant attentions in the operations literature in recent years as it provides a powerful tool to derive structures of optimal policies and allows for efficient computational procedures. In this paper, we present a survey of key properties of L■-convexity and some closely related results in lattice programming, several of which were developed recently and motivated by operations applications. As a new contribution to the literature, we establish the relationship between a notion called m-differential monotonicity and L■-convexity. We then illustrate the techniques of applying L■-convexity through a detailed analysis of a perishable inventory model and a joint inventory and transshipment control model with random capacities.

Coincidence Points and Almost-like Coincidence Points on Generalized ConvexSpaces with Applications

We introduce the concept of a weakly G-quasiconvex map with respect to a map on generalized convex spaces and use the concept to prove coincidence point theorems and almost-like coincidence point theorems. As applications of the above results, we derive almost fixed point theorems and fixed point theorem. These main results generalize and improve some known results in the literature.

Schur Convexity and the Dual Simpson’s Formula

In this paper, we show that some functions related to the dual Simpson’s formula and Bullen- Simpson’s formula are Schur-convex provided that f is four-convex. These results should be compared to that of Simpson’s formula in Applied Math. Lett. (24) (2011), 1565-1568.

On the Random Conjugate Spaces of a Random Locally Convex Module

Theoretically speaking, there are four kinds of possibilities to define the random conjugate space of a random locally convex module. The purpose of this paper is to prove that among the four kinds there are only two which are universally suitable for the current development of the theory of random conjugate spaces. In this process, we also obtain a somewhat surprising and crucial result： if the base （Ω,F, P） of a random normed module is nonatomic then the random normed module is a totally disconnected topological space when it is endowed with the locally L0-convex topology.

The Quasi-Representation Theorem of the Conjugate Cone[L~β(μ,X)]_β~*(о<β<1)

For 0 〈β 〈 1, the author once wrote a paper to deal with the representation problem of the conjugate cone [L^β[0, 1]β^＊ of complex β-nanach space L^β[0, 1]. In this paper, replacing [0, 1] with a Borel finite measure space （Ω,M,μ） and replacing the complex field C with a Banach space X, we study the representation problem of the conjugate cone [L^β（μ, X）]β^＊ of L^β（μ, X）, and obtain [L^β（μ, X）]β^＊≌L^∞ M^＋（μ, S）, called the Quasi-Representation Theorem of [L^β（μ, X）]β^＊.