Related papers: Convex and Concave Soft Sets and Some Properties
Molodtsov \cite{molodtsov-1999} proposed the concept of soft set theory in 1999, which can be used as a mathematical tool for dealing with problems that contain uncertainty. Sabir and Naz \cite{shabir-2013} defined notion of bipolar soft…
This research aimed to introduce the concept of harmonically m-concave set-valued functions, which is obtained from the combination of two definitions: harmonically m-concave functions and set-valued functions. In this work some properties…
In this article, we have introdued D-fuzzy sets. We have discussed the notions of inclusion, union, intersection, complementation and convexity of such D-fuzzy sets. Also we have proved separation theorem of convex D-fuzzy sets.
Soft condensed matter physics is the study of materials, such as fluids, liquid crystals, polymers, colloids, and emulsions, that are ``soft" to the touch. This article will review some properties, such as the dominance of entropy, that are…
In a recent paper, Chiney and Samanta have introduced a new definition of soft topology, using the soft elementary intersection and union. In this paper, basing at this approach, we introduce a definition of soft elementary compact set, and…
This study focuses on convex functions and their generalized. Thus, we start this study by giving the definition of convex functions and some of their properties and discussing a simple geometric property. Then we generalize E-convex…
In the present paper, classical tools of convex analysis are used to study the solution set to a certain class of set-inclusive generalized equations. A condition for the solution existence and global error bounds is established, in the…
Functions with uniform sublevel sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used in multicriteria optimization, decision theory, mathematical…
A class of real functions, which is the generalization of a family of convex functions, is introduced; in this connection, we have defined $X$-convex, strictly $X$-convex, quasi-$X$-convex, strictly quasi-$X$-convex, and semi-strictly…
In this paper, we introduce the notions of I and I*-soft convergence of sequences of soft points in soft topological spaces and study some basic properties of these notions. Also we introduce the notions of I-soft limit points and I-soft…
In this paper, we investigate the concept of p-convexity for sets and functions in n-dimensional Euclidean space. We establish novel algebraic and topological results within this generalized convexity framework. Furthermore, we analyze…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…
This paper studies system theoretic properties of the class of difference inclusions of convex processes. We will develop a framework considering eigenvalues and eigenvectors, weakly and strongly invariant cones, and a decomposition of…
Various characterizations of finite convex geometries are well known. This note provides similar characterizations for possibly infinite convex geometries whose lattice of closed sets is strongly coatomic and lower continuous. Some classes…
The state space of an operator system of $n$-by-$n$ matrices has, in a sense, many normal cones. Merely this convex geometrical property implies smoothness qualities and a clustering property of exposed faces. The latter holds since each…
B. Tanay et. al. introduced and studied fuzzy soft topological spaces. Here we introduce fuzzy soft point and study the concept of neighborhood of a fuzzy soft point in a fuzzy soft topological space. We also study fuzzy soft closure and…
We explore the relationship between convex and subharmonic functions on discrete sets. Our principal concern is to determine the setting in which a convex function is necessarily subharmonic. We initially consider the primary notions of…
In this paper, we introduce the concept of nearly convex set-valued mappings and investigate fundamental properties of these mappings. Additionally, we establish a geometric approach for generalized differentiation of nearly convex…
Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…
Polyhedral convex set optimization problems are the simplest optimization problems with set-valued objective function. Their role in set optimization is comparable to the role of linear programs in scalar optimization. Vector linear…