Throughout this paper, let Z, E, and F be topological vector spaces, let X ⊆ E and Y ⊆ F be nonempty, closed, and convex subsets. Let D : X → 2X , T : X → 2Y and Ψ : X ×Y × X → 2Z be set-valued mappings, and let C : X → 2Z be a set-valued mapping such that C(x) is a closed pointed and convex cone with intC(x) = ∅ for each x ∈ X , where intC(x) denotes the interior of the set C(x). Then the gene...

a r t i c l e i n f o a b s t r a c t Keywords: Graph algorithms Simple-path convexity Simple-path convex hull Totally balanced hypergraphs In a connected hypergraph a vertex set X is simple-path convex (sp-convex, for short) if either |X| 1 or X contains every vertex on every simple path between two vertices in X (Faber and Jamison, 1986 [7]), and the sp-convex hull of a vertex set X is the mi...

In this paper, a characterization of convex fuzzy mappings is obtained. SupposeF C : ® F is a fuzzy mapping, whereC is a non-empty convex subset ofR andF is the set of all fuzzy numbers. With respect to the fuzzy-max order, F is convex if and only if it is both quasi-convex and intermediate-point convex. In this paper, a characterization of convex fuzzy mappings will be given. Specifically, it ...

Let X be a complex space and f : X → I R a real valued function. Then f is said to be q-convex if for any x ∈ X there exist a neighborhood U which is biholomorphic to a closed analytic set in an open set Ω ⊂ I C and a function g ∈ C(Ω) such that i∂∂g has at most q − 1 zero or negative eigenvalues at each point of Ω and f |U = g|U . The space X is called q-complete if there exists an exhaustion ...

Abstract. In this paper, we define the notion of C*-affine maps in the unital *-rings and we investigate the C*-extreme points of the graph and epigraph of such maps. We show that for a C*-convex map f on a unital *-ring R satisfying the positive square root axiom with an additional condition, the graph of f is a C*-face of the epigraph of f. Moreover, we prove som...

Let (X, ‖ · ‖) be a real Banach space. Let C be a closed convex set in X. By a drop D(x, C) determined by a point x ∈ X, x / ∈ C, we shall mean the convex hull of the set {x} ∪ C. We say that C has the drop property if C 6= X and if for every nonvoid closed set A disjoint with C, there exists a point a ∈ A such that D(a, C) ∩ A = {a}. For a given C a sequence {xn} in X will be called a stream i...

Let F be a subset of the n-dimensional Euclidean spaceR represented in terms of a compact convex subset C0 and a set PF of nitely or in nitely many quadratic functions on R such that F = fx 2 C0 : p(x) 0 (8p( ) 2 PF )g. In this paper, we investigate some fundamental properties related to the nite convergence of the successive SDP (semide nite programming) relaxation method proposed by the autho...

The purpose of this paper is to prove a correlation inequality for n increasing functions on a distributive lattice. For finite lattices, it is possible to combine the entire family of inequalities (for all n) into a single statement involving the ring of formal power series. This is the form in which we first formulate and prove our result. Thus, let X be a finite set and regard the power set ...

We show that in a Banach space X every closed convex subset is strongly proximinal if and only if the dual norm is strongly sub differentiable and for each norm one functional f in the dual space X∗, JX(f) the set of norm one elements in X where f attains its norm is compact. As a consequence, it is observed that if the dual norm is strongly sub differentiable then every closed convex subset of...

0 Introduction For n 2, Let M n be a nite convex, not necessarily smooth, hypersur-face in Euclidean space R n+1 containing the origin. More precisely, M n is the boundary of some convex domain in R n+1 containing a neighborhood of the origin. We write M n = fR(x) = (x)x j x 2 S n g, where is a function from S n to R +. Let : M n ! S n denote the generalized Gauss map, namely, (Y) is the set of...