نتایج جستجو برای: m fuzzifying convex structure

تعداد نتایج: 2071190  

Journal: :Annales Mathematicae Silesianae 2019

Journal: :Mathematics of Operations Research 1999

Journal: :J. Symb. Log. 2005
Marcus Tressl

Contents 1. Introduction. 2. Heirs. 3. The invariance group of a cut. 4. Review of T-convex valuation rings. 5. The invariance valuation ring of a cut. 6. A method for producing cuts with prescribed signature. 7. Existentially closed extensions. 1. Introduction. Let M be a totally ordered set. A (Dedekind) cut p of M is a couple (p L , p R) of subsets p L , p R of M such that p L ∪ p R = M and ...

2014
Jules Desharnais Bernhard Möller

Fuzzy relations are mappings from pairs of elements into the interval [0, 1]. As a replacement for the complement operation one can use the mapping that sends x to 1 − x. Together with the concepts of t-norm and t-conorm a weak form of Boolean algebra can be defined. However, to our knowledge so far no notion of domain or codomain has been investigated for fuzzy relations. These might, however,...

Journal: :Discrete Applied Mathematics 1998

‎In this paper, generalized convex contractions on orthogonal metric spaces are stablished in whath  might be called their  definitive versions. Also, we show that there are examples which show that our main theorems are  genuine generalizations of Theorem 3.1 and 3.2 of [M.A. Miandaragh, M. Postolache and S. Rezapour,  {it Approximate fixed points of generalized convex contractions}, Fixed Poi...

In this paper we study the concept of Latin-majorizati-\on. Geometrically this concept is different from other kinds of majorization in some aspects. Since the set of all $x$s Latin-majorized by a fixed $y$ is not convex, but, consists of union of finitely many convex sets. Next, we hint to linear preservers of Latin-majorization on $ mathbb{R}^{n}$ and ${M_{n,m}}$.

Journal: :European Journal of Operational Research 2008
Adi Ben-Israel Genrikh Levin Yuri Levin Boris Rozin

Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The problem has a series-parallel structure, with the variables divided serially into n disjoint subsets, whose elements are considered in parallel. This special structure is exploited in two algorithms proposed here for the a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید