نتایج جستجو برای: convexity
تعداد نتایج: 8619 فیلتر نتایج به سال:
We extend a result of Minsky to show that for a map of a surface to a hyperbolic 3-manifold which is not necessarily π1-injective but is 2-incompressible rel a geodesic link with a definite tube radius, the set of noncontractible simple loops with a bounded length representatives is quasi-convex in the complex of curves.
This paper presents an analysis of the problem of aggregating preference orderings under subjective uncertainty. Individual preferences, or opinions, agree on the ranking of risky prospects, but are quite general because we do not specify the perception of ambiguity or the attitude towards it. A convexity axiom for the ex-ante preference characterizes a (collective) decision rule that can be in...
convexity theory and duality theory are important issues in math- ematical programming. within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. finally,...
In this work we deal with the so-called path convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with the well-known geodesic convexity, while the collection of the induced paths is associated with the monophonic convexity ; and there are many other examples. Besides reviewing the path convexities in the literature, ...
We study the existence of Stackelberg equilibrium points on strategy sets which are geodesic convex in certain Riemannian manifolds by using metric projection arguments. The present results extend those obtained in Nagy [J. Global Optimization (2013)] in the Euclidean context.
There exists a surface of a convex polyhedron P and a partition L of P into geodesic convex polygons such that there are no connected"edge"unfoldings of P without self-intersections (whose spanning tree is a subset of the edge skeleton of L).
It is shown that a subset of a uniformly convex normed space is nearly convex if and only if its closure is convex. Also, a normed space satisfying a mild completeness property is strictly convex if and only if every metrically convex subset is convex. 1 Classical and constructive mathematics The arguments in this paper conform to constructive mathematics in the sense of Errett Bishop. This mea...
Gordon G Johnson* ([email protected]), Department of Mathematics, University of Houston, Houston, TX 77204-3008. The Closure in a Hilbert Space of a PreHilbert Space CHEBYSHEV Set Fails to be a CHEBYSHEV Set. Preliminary report. E is the real inner product space that is union of all finite-dimensional Euclidean spaces, S is a certain bounded nonconvex set in the E having the property that every...
In this paper, some properties of pre-monotone operators are proved. It is shown that in a reflexive Banach space, a full domain multivalued $sigma$-monotone operator with sequentially norm$times$weak$^*$ closed graph is norm$times$weak$^*$ upper semicontinuous. The notion of $sigma$-convexity is introduced and the relations between the $sigma$-monotonicity and $sigma$-convexity is i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید