Search

Most complex problems in the real-world typically involve uncertain, incomplete and indeterminate two-dimen sional data i.e. information pertaining to the attributes and the periodicity of the problem parameters. To meet the demand for models that has the ability to handle these information with these characteristics, the introduction of neutrosophic sets (NSs) was followed by their extension to the complex neutrosophic sets (CNSs). In this paper, we introduce the concept of Q- complex neutrosophic set (Q-CNS) by extending the ranges of the membership functions in Q-neutrosophic set (Q-NS) from [0,1] to the unit circle in the complex plane. Q-CNS plays a key role in the decision making theory, where the extra information provided by the elements of the Q-set serve in modeling of some decision making problems. Based on this new concept we define the basic theoretical operations such as complement, equality, subset, union, intersection, Q-complex neutrosophic product and Cartesian product. Some related examples are also given to enhance the understanding of the proposed concepts. The basic properties of these operators are also verified with supporting proofs. [ABSTRACT FROM AUTHOR]

The notion of classical soft multisets is extended to neutrosophic vague soft multisets by applying the theory of soft multisets to neutrosophic vague sets to be more effective and useful. We also define its basic operations, namely complement, subset, union, intersection along with illustrative examples, and study some related properties with supporting proofs. Lastly, this notion is applied to a decision making problem and its effectiveness is demonstrated using an illustrative example. [ABSTRACT FROM AUTHOR]

In this paper, we first introduce the concept of neutrosophic vague soft expert sets (NVSESs for short) which combines neutrosophic vague sets and soft expert sets to be more effective and useful. We also define its basic operations, namely complement, union, intersection, AND and OR along with illustrative examples, and study some related properties with supporting proofs. Lastly, this concept is applied to a decision making problem and its effectiveness is demonstrated using a hypothetical example. [ABSTRACT FROM AUTHOR]

The basic aim of soft computing is to trade precision for a tractableness and reduction in solution cost by pushing the limits of tolerance for imprecision and uncertainty. This paper introduces a novel soft computing technique called complex neutrosophic relation (CNR) to evaluate the degree of interaction between two complex neutrosophic sets (CNSs). CNSs are used to represent two-dimensional information that are imprecise, uncertain, incomplete and indeterminate. The Cartesian product of CNSs and subsequently the complex neutrosophic relation is formally defined. This relation is generalised from a conventional single valued neutrosophic relation (SVNR), based on CNSs, where the ranges of values of CNR are extended to the unit circle in complex plane for its membership functions instead of [0, 1] as in the conventional SVNR. A new algorithm is created using a comparison matrix of the SVNR after mapping the complex membership functions from complex space to the real space. This algorithm is then applied to scrutinise the impact of some teaching strategies on the student performance and the time frame(phase) of the interaction between these two variables. The notion of inverse, complement and composition of CNRs along with some related theorems and properties are introduced. The performance and utility of the composition concept in real-life situations is also demonstrated. Then, we define the concepts of projection and cylindric extension for CNRs along with illustrative examples. Some interesting properties are also obtained. Finally, a comparison between different existing relations and CNR to show the ascendancy of our proposed CNR is provided. [ABSTRACT FROM AUTHOR]