New Operations On Fuzzy Neutrosophic Soft

Matrices
ISSN 2319-9725
I.R.Sumathi
Department of Mathematics, Nirmala College for Women,
Coimbatore, Tamilnadu, India.
I.Arockiarani
Department of Mathematics, Nirmala College for Women,
Coimbatore, Tamilnadu, India.

Abstract: In this paper we define some new operations on fuzzy neutrosophic soft matrices and their
properties which are more functional to make theoretical studies. We finally construct a decision
making method which can be applied to the problems that contain uncertainties.
Keywords: Soft sets, Fuzzy Neutrosophic soft set and Fuzzy Neutrosophic soft matrices.

December, 2014

www.ijirs.com

Vol3 Issue 12

1. Introduction:
In 1999, [9] Molodtsov initiated the novel concept of soft set theory which is a completely
new approach for modeling vagueness and uncertainty. In [4] Maji et al. initiated the concept
of fuzzy soft sets with some properties regarding fuzzy soft union , intersection, complement
of fuzzy soft set. Moreover in [5],[6] Maji et al extended soft sets to intuitionistic fuzzy soft
sets and Neutrosophic soft sets and the concept of Neutrosophic set was initiated by
Smarandache [11] which is a generalization of fuzzy logic and several related systems.
Neutrosophic sets and logic are the foundations for many theories which are more general
than their classical counterparts in fuzzy, intuitionistic fuzzy and interval valued frameworks.
One of the important theory of mathematics which has a vast application in science and
engineering is the theory of matrices. In [12] Yong et al. initiated a matrix representation of
fuzzy soft set and applied it in decision making problems. In [8] Manoj Bora et al introduced
the intuitionistic fuzzy soft matrices and applied in the application of medical diagnosis. In
this paper we have introduced some new operations on fuzzy neutrosophic soft matrices and
some related properties have been established.

2. Preliminaries:
Definition 2.1: [9]
Suppose U is an universal set and E is a set of parameters, Let P(U) denote the power set of
U. A pair (F, E) is called a soft set over U where F is a mapping given by F: EP(U).
Clearly, a soft set is a mapping from parameters to P(U) and it is not a set, but a
parameterized family of subsets of the universe.
Definition 2.2:[1]
A Fuzzy Neutrosophic set A on the universe of discourse X is defined as
A= , , , , where , , : [0, 1] and 0 TA ( x) I A ( x) FA ( x) 3

International Journal of Innovative Research and Studies

Page 110

www.ijirs.com

December, 2014

Vol3 Issue 12

Definition 2.3:[1]
Let U be the initial universe set and E be a set of parameters. Consider a non-empty set A, A
E. Let P (U) denote the set of all fuzzy neutrosophic sets of U. The collection

(F, A) is

termed to be the fuzzy neutrosophic soft set over U, where F is a mapping given by
F: A P(U).
Definition 2.4:[2]
Let U = { c1, c2, cm} be the universal set and E be the set of parameters given by E
= {e1, e2, . en}. Let A E. A pair (F, A) be a Fuzzy Neutrosophic soft set over U. Then
the subset of U x E is defined by RA = { (u, e) ; eA, u fA(e)} which is called a relation
form of (fA ,E). The membership function , indeterminacy membership function and non
membership function are written by

FR : U E [0,1]
A

where

TR (u, e) [0,1]
A

TR : U E [0,1]
A

I R (u, e) [0,1]
A

I R : U E [0,1]

and

FR (u, e) [0,1]
A

and

are the

membership value, indeterminacy value and non membership value respectively of u U for
each eE.
If [(Tij , Iij , Fij)] = (Tij(ui , ej) , Iij(ui , ej) , Fij(ui , ej)) we can define a matrix
T , I , F
T , I , F
12 12 12
11 11 11

T , I , F
T , I , F
Tij , I ij , Fij
21 21 21
22 22 22
mxn
................
.................
T , I , F T , I , F
m1 m1 m1 m 2 m 2 m 2

................

................

.............. T , I , F
mn mn mn
................

T , I , F
1n 1n 1n
T , I , F
2n 2n 2n
.................

which is called an m x n Fuzzy Neutrosophic Soft Matrix of the FNSS (fA , E) over U.
Definition 2.5:[2]
Let U = { c1, c2, cm} be the universal set and E be the set of parameters given by E
= {e1, e2, . en}. Let A E. A pair (F, A) be a fuzzy neutrosophic soft set. Then fuzzy
neutrosophic soft set (F, A) in a matrix form as Am x n = [aij]m x n or A = [aij] , i=1,2,.m, j =
1,2, .. n where

International Journal of Innovative Research and Studies

Page 111

www.ijirs.com

December, 2014

Vol3 Issue 12

T j (ci ) , I j (ci ), F j (ci )

aij
(0, 0, 1)

if e A
j
if e A
j
,

T j (c )
( c ) I (c )
i represent the membership of i , j i represent the indeterminacy of

where

F (c )
(c )
(c )
i and j i represent the non-membership of i

in the fuzzy neutrosophic set

F (e )
j .
Note: Fuzzy Neutrosophic soft matrix is denoted by FNSM

3. Fuzzy Neutrosophic Soft Matrices:

Definition 3.1:

Let

~
~
~
~
A TijA , I ijA , FijA

, B~ T

~
B
ij

, I ijB , FijB

FNSM

mxn.

Then
~

~
~ ~ TA TB I A IB
~
a) A is Fuzzy neutrosophic soft sub matrix of B denoted by A B if ij ij , ij ij
~

and

FijA

FijB

, i and j.

~
~ ~ TijA TijB I ijA I ijB
~
A
B
A
b)
is Fuzzy neutrosophic soft super matrix of
denoted by B if

and

FijA FijB

, i and j.

~
~ ~
~
c) A and B are said to be Fuzzy neutrosophic soft equal matrices denoted by A = B if
~

TijA

TijB

IA IB
, ij = ij and

FijA

FijB

, i and j.

Definition 3.2:
T (c ) , I (c ), F (c )
j i
~C
j i
j i
where [aij] =
then A is called fuzzy
~C
neutrosophic soft complement matrix if A = [bij]m x n where
~
If A = [aij] FNSMm x n ,

International Journal of Innovative Research and Studies

Page 112

www.ijirs.com

December, 2014

Vol3 Issue 12

[b ] F (c ) ,1 I (c ), T (c )
ij
j i
j i
j i

Definition 3.3:

~
~
~
~
A TijA , I ijA , FijA

Let

FNSM

mxn.

~
Then A is called

d) a

TijA

-universal FNSM denoted by UT= [1,0,0] if

TijA

e) a

I ijA

-universal FNSM denoted by UI = [0,1,0] if

TijA

f) a

FijA

=1,

I ijA

=0,

I ijA

=0,

I ijA

-universal FNSM denoted by UF= [0,0,1] if

TijA

= 0 and

= 1 and

FijA

= 0 and

FijA

FijA

= 0, i and j.

= 0, i and j.

= 1, i and j.

Definition 3.4:

~
~
~
~
A TijA , I ijA , FijA

Let

, B~ T

~
B
ij

, I ijB , FijB

FNSM

m x n.

~
~
~
~
C TijC , I ijC , FijC

Then FSNM

is

called
~

a)

and

FA FB
= min ( ij , ij ) i and j.

FijC

b)

~
~
~
~ TC
TA TB IC
IA IB
Union of A and B denoted by A B if ij = max ( ij , ij ) , ij = max ( ij , ij )

~
~
~
~ TC
TA TB
Intersection of A and B denoted by A B if ij = min ( ij , ij ) ,
~

I ijC

~
~
~
~
A TijA , I ijA , FijA

, B~ T

I ijA I ijB
FijC
FijA FijB
= min ( ,
) and
= max (
,
) i and j.

Definition 3.5:

Let

~
B
ij

, I ijB , FijB

FNSM

m x n.

Then FSNM

~
~
~
~
C TijC , I ijC , FijC

is

called
~

a)

~ ~ ~ TC TA TB
~
~
The * (product) operation of A and B denoted by C = A * B if ij = ij . ij ,
~

I ijC

IA IB
FC F A FB F A FB
= ij . ij and ij = ij + ij ij . ij i and j.

International Journal of Innovative Research and Studies

Page 113

www.ijirs.com

December, 2014

Vol3 Issue 12

~ ~ ~ ~
~
~
~
b) The (probabilistic sum) operation of A and B denoted by C = A B if
~

TijC
c)

TijA

TijB

T A TB IC I A IB I A IB
FC F A FB
ij . ij , ij = ij + ij ij . ij and ij = ij . ij i and j.

~ ~
~
~
~
The @ (Arithmetic mean) operation of A and B denoted by C = A @ B if
~

~
C
ij

TijA TijB
2

~
C
ij

I
,

I ijA I ijB

~
C
ij

and

FijA FijB

i and j.

~
~
d) The @W (weighted Arithmetic mean) operation of A and B denoted by
~

~
C
ij

T
~ ~
~
C = A @W B if
~

~
C
ij

e)

w1TijA w 2TijB
w1 w 2

~
C
ij

w1 I ijA w 2 I ijB
w1 w 2

and

w1 FijA w 2 FijB
w1 w 2

i and j.

~ ~ ~
~
~
The $ (Geometric mean) operation of A and B denoted by C = A $ B if
~

TijC TijA TijB

I ijC I ijA I ijB

and

FijC FijA FijB

i and j.

~ ~
~
~
~
f) The $W (Weighted geometric mean) operation of A and B denoted by C = A $W B if

~
T TijA

~
C
ij

w1

~ w
B 2
ij

w1 w2 C~ A~
I ij I ij

w1

~ w
B 2
ij

~
w1 w2
A~
C
F

ij

Fij
and

w1

~ w
B 2
ij

w1 w2

i and j.
g)

~ ~
~
~
~
The & (Harmonic mean) operation of A and B denoted by C = A & B if
~

~
C
ij

T 2

TijA TijB
~

~
C
ij

I 2

TijA TijB

I ijA I ijB
~

~
C
ij

F 2

I ijA I ijB

and

FijA FijB
~

FijA FijB

i and j.

~ ~
~
~
~
h) The &W (Weighted Harmonic mean) operation of A and B denoted by C = A &W B

International Journal of Innovative Research and Studies

Page 114

www.ijirs.com

December, 2014
~

TijC
if

w1 w2
w1 w2
~
~
TijA TijB

w1 w2
w1 w2
~
~
I ijA I ijB

I ijC
,

FijC
and

Vol3 Issue 12

w1 w2
w1 w2
~
~
FijA FijB

i and j.

Proposition 3.6:

~
~
~
~
A TijA , I ijA , FijA

Let

, B~ T

~
B
ij

, I ijB , FijB

FNSM

mxn

, then

~
~ ~ ~
~ ~ ~
~
(i) ( A B ) ( A B ) = A B
~
~
~ ~
~
~
(ii) ( A B ) * ( A B ) = A * B

~
~
~
~
~
~
(iii) ( A B ) @ ( A B ) = A @ B
~
~
~ ~
~
~
(iv) ( A B ) $ ( A B ) = A $ B
~
~
~
~
~
~
(v) ( A B ) & ( A B ) = A & B
~~ ~
~ ~
~
~
(vi) ( A B ) @ ( A * B ) = A @ B

Proof:
~

~
~ ~ ~
~
TA TB
IA IB
FA FB ~
(i) ( A B ) ( A B ) = [min { ij , ij } , min { ij , ij }, max { ij , ij }]
~

TA TB
IA IB
FA FB
[max { ij , ij } , max { ij , ij }, min { ij , ij }]
~

TA TB
TA TB
TA TB
TA TB
= {[min { ij , ij }+ max { ij , ij } min { ij , ij }. max { ij , ij }] ,
~

IA IB
IA IB
IA IB
IA IB
[min { ij , ij } + max { ij , ij } min { ij , ij } . max { ij , ij }],
~

FA FB
FA FB
[max { ij , ij }. min { ij , ij }]}
~

= {(

TijA

TijB

TA TB IA IB IA IB
ij . ij , ij + ij ij . ij

FijA FijB
.
)} [since min (a,b) + max(a,b) = a+ b
& min(a,b) . max(a,b) = a.b]

~ ~ ~
= A B
International Journal of Innovative Research and Studies

Page 115

www.ijirs.com

December, 2014

Vol3 Issue 12

Similarly we can prove the other results.

Example 3.7:

Let

~
~
~
~
A TijA , I ijA , FijA

, B~ T

~
B
ij

, I ijB , FijB

FNSM

m x n where

~ (0.3,0.4,0.2) (0.4,0.6,0.5)
~ (0.4,0.5,0.3) (0.6,0.5,0.2)
A
B

(0.5,0.7,0.3) (0.7,0.4,0.2) 2 x 2 and

(0.7,0.6,0.2) (0.3,0.5,0.4) 2 x 2
~ ~ (0.3,0.4,0.3) (0.4,0.5,0.5)
~ ~ (0.4,0.5,0.2) (0.6,0.6,0.2)
AB
AB

(0.5,0.6,0.3) (0.3,0.4,0.4) 2 x 2 and

(0.7,0.7,0.2) (0.7,0.5,0.2) 2 x 2

A~ B~ ~ A~ B~ ((00..8558,,00..887,,00..0606))

(0.76,0.8,0.1)
(0.79,0.7,0.08) 2 x 2

~ ~ ~
= A B

Definition 3.8:

Let
a)

~
~
~
~
A TijA , I ijA , FijA

FNSM

mxn

~
~
The necessity operation of A denoted by A and is defined as

~
~
~
~
A TijA , I ijA ,1 TijA

i and j.

~
~
b) The possibility operation of A denoted by A and is defined as

a)

~
~
~
~
A TijA ,1 I ijA , FijA

i and j.

~
~
The falsity operation of A denoted by A and is defined as

~
~
~
~
A 1 FijA , I ijA , FijA

i and j.

Proposition 3.9:

Let

~
~
~
~
A TijA , I ijA , FijA

FNSM

mxn

, then

~
~C
(i) [( A )]C = A

International Journal of Innovative Research and Studies

Page 116

www.ijirs.com

December, 2014

Vol3 Issue 12

~
~C
(ii) [( A )]C = A
~
~C
(iii) [( A )]C = A
~
~
(iv) A = A

~
~
(v) A = A
~
~
(vi) A = A
~
~
(vii) A = A
~
~
(viii) A = A
~
~
(ix) A = A

~ ~
(x) A = A

Proof:

= 1 F

~ C

~C
F A ,1 I ijA , TijA C FijA ,1 I ijA ,1 FijA
(i) [( A )]C =[ ij
] =

~
A
ij

, I ijA , FijA

= A~

Similarly we can prove the other results.

Example 3.10:

Let

~
~
~
~
A TijA , I ijA , FijA

FNSM

m x n where

(0.2,0.6,0.3) (0.5,0.3,0.4)
~ (0.3,0.4,0.2) (0.4,0.7,0.5)
~
A
AC

(0.5,0.3,0.3) (0.7,0.9,0.2) 2 x 2 then

(0.3,0.7,0.5) (0.2,0.1,0.7) 2 x 2
(0.2,0.6,0.8) (0.5,0.3,0.5)
~
AC

(0.3,0.7,0.7) (0.2,0.1,0.8) 2 x 2

(0.8,0.4,0.2) (0.5,0.7,0.5)
~
[ A C ] ]C

~
(0.7,0.3,0.3) (0.8,0.9,0.2) 2 x 2 = A
[
.

International Journal of Innovative Research and Studies

Page 117

www.ijirs.com

December, 2014

Vol3 Issue 12

Proposition 3.11:

Let

~
~
~
~
A TijA , I ijA , FijA

, B~ T

~
B
ij

, I ijB , FijB

FNSM

mxn

, then

~
~
~
~
(i) [ A B ] = A B
~
~
~
~
(ii) [ A B ] = A B
~
~C ~ ~C
~
(iii) [[ A B ]]C = A * B
~ ~ ~
~C ~C
(iv) [[ A * B ]]C = A B
~ ~
~C ~ ~C
(v) [ [ A B ]]C = ( A * B )
~ ~ ~
~C ~C
(vi) [ [ A * B ]]C = ( A B )
~
~C ~ ~C
~
(vii) [ [ A B ]]C = A * B
~ ~ ~
~C ~C
(viii) [ [ A * B ]]C = A B
~
~
~
~
(ix) [ A @ B ] = A @ B

~
~
~
~
(x) [ A @ B ] = A @ B
~
~
~
~
(xi) [ A @ B ] = A @ B

Proof:
~

~
~
TA TB
IA IB
FA FB
(i) [ A B ] = [ min { ij , ij } , min { ij , ij }, max { ij , ij }]
~

TA TB
IA IB
TA TB
=[ min { ij , ij } , min { ij , ij }, 1 min { ij , ij }] ---------(1)

~
~
~
~
A TijA , I ijA ,1 TijA

~
~
~
~
B TijB , I ijB ,1 TijB

~
~
TB
TA TB
IA IB
TA
A B = [min { ij , ij } , min { ij , ij }, max {1 ij , 1 ij }]
~

TijA TijB
I ijA I ijB
TijA TijB
=[ min { ,
} , min { ,
}, 1 min { ,
}] ----------(2)
International Journal of Innovative Research and Studies

Page 118

www.ijirs.com

December, 2014

Vol3 Issue 12

~
~
~
~
From (1) & (2) we have [ A B ] = A B . Similarly we can prove the other results.

Definition 3.12:

Let

, B~ T

~
~
~
~
A TijA , I ijA , FijA

~
B
ij

, I ijB , FijB

FNSM

mxn.

Then the operation (Implication)

~ ~
denoted by A B is defined as
~

B
B
B
A
A
A
~ ~
A B = [(max ( Fij , Tij ) , max( 1 I ij , I ij ), min ( Tij , Fij )].

Proposition 3.13:

Let

~
~
~
~
A TijA , I ijA , FijA

, B~ T

~
B
ij

, I ijB , FijB

, C~ T

~
C
ij

, I ijC , FijC

FNSM

m x n. Then

~
~
~ ~
~
~ ~
(i) [ A B ] C = [ A C ] [ B C ]

~ ~C ~C
(ii) A A = A
~
~
~ ~
~
~ ~
(iii) [ A B ] C [ A C ] [ B C ]
~
~ ~
~ ~
~ ~
(iv) [ A B ] C [ A C ] [ B C ]
~
~~ ~
~ ~ ~ ~ ~
(v) [ A B ] C [ A C ] [ B C ]
~
~ ~
~ ~
~ ~
(vi) [ A * B ] C [ A C ] * [ B C ]

~
~ ~ ~ ~ ~
~~ ~
(vii) A [ B C ] [ A B ] [ A C ]
~
~ ~
~ ~
~ ~
(viii) A [ B * C ] [ A B ]* [ A C ]

Proof:
~

~
~
TA TB
IA IB
FA FB
[ A B ] = [min { ij , ij } , min { ij , ij }, max { ij , ij }]
~

~
~
~
1 min( I ijA I ijB I ijC
FA FB TC
[ A B ] C = [max((max ( ij , ij )), ij ) , max((
,
)), ),
~

T A T B FC
min((min ( ij , ij )) ij )]. -------(1)
International Journal of Innovative Research and Studies

Page 119

www.ijirs.com

December, 2014
~

Vol3 Issue 12

A
C
A
C
A
C
~
~
A C = [(max ( Fij , Tij ) , max( 1 I ij , I ij ), min ( Tij , Fij )].

B
B
B
C
C
C
~ ~
B C = [(max ( Fij , Tij ) , max( 1 I ij , I ij ), min ( Tij , Fij )].
~

~ ~
~ ~
FB TC
FA TC
[ A C ] [ B C ] = [max{(max ( ij , ij ),(max ( ij , ij )},
~

1 I ijB I ijC
1 I ijA I ijC
max { max(
,
), max(
, )},
~

T B FC
T A FC
min {min ( ij , ij ), min ( ij , ij )}]
~

1 min( I ijA I ijB I ijC

FA FB TC
= [max((max ( ij , ij )), ij ) , max((
,
)), ),
~

T A T B FC
min((min ( ij , ij )) ij )]. -------(2)
~
~
~ ~
~
~ ~
From (1) & (2) [ A B ] C = [ A C ] [ B C ]

Similarly we can prove the other results.

Example 3.14:

Let

~
~
~
~
A TijA , I ijA , FijA

, B~ T

~
B
ij

, I ijB , FijB

, C~ T

~
C
ij

, I ijC , FijC

FNSM

m x n where

~ (0.3,0.4,0.2) (0.4,0.6,0.5)
~ (0.4,0.5,0.3) (0.6,0.5,0.2)
A
B

(0.5,0.7,0.3) (0.7,0.4,0.2) 2 x 2 ,
(0.7,0.6,0.2) (0.3,0.5,0.4) 2 x 2 and
~ (0.3,0.4,0.6) (0.4,0.5,0.6)
C

(0.6,0.7,0.3) (0.5,0.4,0.4) 2 x 2

~
~~ ~
[ A B ] C =

(0.3,0.4,0.58) (0.4,0.5,0.6)
(0.6,0.7,0.3) (0.5,0.4,0.4)

2x2

(0.51,0.8,0.12) (0.7,0.75,0.24)

(0.84,0.91,0.09) (0.75,0.8,0.12)
~ ~ ~ ~ ~
2x2
[ A C ] [ B C ]

International Journal of Innovative Research and Studies

. (1)

. (2)

Page 120

www.ijirs.com

December, 2014

Vol3 Issue 12

~
~~ ~
~ ~ ~ ~ ~
From (1) and (2) [ A B ] C [ A C ] [ B C ]

~W
4. Application Of Weighted Arithmetic Mean ( AAM ) Of Fuzzy Neutrosophic Soft
Matrix In Decision Making:

~
~W
In this section we define arithmetic mean( AAM ) and weighted arithmetic mean( AAM ) of
fuzzy neutrosophic soft matrix.
Definition 4.1:

Let

~
~
~
~
A TijA , I ijA , FijA

neutrosophic

soft

FNSM

matrix

~
A

, then the weighted arithmetic mean of fuzzy

~W
AAM
denoted by
is defined as,

m x n

n
n
~
~
~
n
A
A
A
w
T
w
I
w
F
j ij j ij j ij
j 1
j 1
j 1

n
, n
, n

wj
wj

wj
j 1
j 1
j 1
and wj for j = 1, 2, n.

~
AW

AM

Definition 4.2:

Let

~
~
~
~
A TijA , I ijA , FijA

FNSM

m x n

, then the arithmetic mean of fuzzy neutrosophic soft

~
AAM

~
matrix A denoted by

~
AAM is defined as ,

n A~ n A~ n A~
Tij I ij Fij
j 1
j 1
j 1

,
,
n
n
n

when weights are

equal.
Definition 4.3:
The score value of Si for uiU is defined as

S i Ti I i .Fi

Algorithm:
1. Construct an FNSS (F,A) over U
2. Construct the Fuzzy Neutrosophic soft matrix of (F,A)

~
~W
3. Compute arithmetic mean AAM and weighted arithmetic mean AAM
International Journal of Innovative Research and Studies

Page 121

www.ijirs.com

December, 2014

Vol3 Issue 12

~
~W
4. Compute the score value of Si for AAM and AAM
5. Find Sj = max(Si), then we conclude that ui is suitable.
Example:
Suppose there are five suppliers U={u1, u2, u3, u4, u5} whose core competencies are evaluated
by means of parameters E = A = {e1, e2, e3} where e1 = level of technology innovation, e2 =
the ability of the management and e3 = level of service. Suppose a manufacturing company
which wants to select the best supplier according to the core competencies. A fuzzy
neutrosophic soft set is given by
(F,A) =
{{F(e1) = {(u1,0.5,0.6,0.4), (u2,0.9,0.4,0.1), (u3,0.6,0.4,0.2), (u4,0.6,0.4,0.2), (u5,0.4,0.5,0.3)}
{F(e2) = {(u1,0.6,0.7,0.2), (u2,0.5,0.7,0.1), (u3,0.5,0.4,0.4), (u4,0.8,0.6,0.2), (u5,0.6,0.4,0.2)}
{F(e3) = {(u1,0.5,0.6,0.2), (u2,0.4,0.8,0.3), (u3,0.7,0.6,0.2), (u4,0.6,0.4,0.4), (u5,0.5,0.5,0.1)}}
The matrix representation for the above is given as

(0.5,0.6,0.4)
(0.9,0.4,0.1)
~
A (0.6,0.4,0.2)

(0.6,0.4,0.2)
(0.4,0.5,0.3)

~
AAM

(0.6,0.7,0.2)
(0.5,0.7,0.1)
(0.5,0.4,0.4)
(0.8,0.6,0.2)
(0.6,0.4,0.2)

(0.5,0.6,0.2)
(0.4,0.8,0.3)
(0.7,0.6,0.2)

(0.6,0.4,0.4)
(0.5,0.5,0.1)

(0.5333,0.6333,0.2667)
(0.6,0.6333,0.1667)

(0.6,0.4667,0.2667)

(0.6667,0.4667,0.2667)
(0.5,0.4667,0.2)

If we prefer to give weights 0.8, 0.1 and 0.1 on the parameters e1, e2 and e3 respectively then
the weighted arithmetic mean is given by

International Journal of Innovative Research and Studies

Page 122

www.ijirs.com

December, 2014

~W
AAM

Vol3 Issue 12

(0.51,0.61,0.36)
(0.81,0.47,0.12)

(0.6,0.42,0.22)

(0.62,0.42,0.22)
(0.43,0.49,0.27

~
AAM
The score of

0.3664
0.2904
0.4944
0.7536

~
0.4755
A WAM 0.5076

0.5422
0.5276
0.4067
0.2977
and the score of
.

Form the above results , it is clear that if we give equal preference for the parameters , we
have u4 is the best alternative and when we give more preference on level of technology
innovation, then we have same u2 is the best alternative.

5. Conclusion:
Soft set theory is a general method for solving problems of uncertainty. In this paper, we
define Fuzzy Neutrosophic soft matrices and their operations which are more functional to
improve several new results. Finally we have given one application for decision making
based on arithmetic mean.

International Journal of Innovative Research and Studies

Page 123

December, 2014

www.ijirs.com

Vol3 Issue 12

References:
1. I.Arockiarani,I.R.Sumathi & J.Martina Jency Fuzzy Neutrosophic soft topological
spacesIJMA 4 (10) 2013., 225-238.
2. I.Arockiarani and I.R.Sumathi,

A fuzzy neutrosophic soft

Matrix approach in

decision making, JGRMA, Vol 2, No.2, 14-23, Feb 2014.

3. Chetia.B,Das.P.K, Some results of intuitionistic fuzzy soft matrix theoryAdvances
in applied science research 3(1) : 412 423 (2012).
4. Maji.P.K, Biswas.R and Roy.A.R , Fuzzy soft set The journal of fuzzy
mathematics, Vol 9(3), pp 589 - 602 (2001).
5. Maji.P.K, Biswas.R and Roy.A.R , Intuitionistic fuzzy soft sets Journal of fuzzy
mathematics, 12, pp - 669 683 (2004).
6. Pabitra Kumar Maji , Neutrosophic soft set , Annals of Fuzzy Mathematics and
Informatics,Volume 5, No.1, pp.157-168 (2013).
7. Manash Jyoti Borah, Tridiv Jyotic Neog, Dusmenta Kumar Sut , Fuzzy soft matrix
theory and its decision making IJMER Vol.2.,pp 121 127 (2012).
8. Manoj Bora, Banashree Bora, Tridiv Jyotic Neog, Dusmenta Kumar Sut,
Intuitionistic fuzzy soft matrix theory and its application in medical diagnosis,
Annals of Fuzzy Mathematics and Informatics,Volume x, No.x, pp.1 - xx (2013).
9. Molodtsov D., Soft set theory first results , Computer and mathematics with
applications, 37 ,pp- 19 31(1999).
10. F.Smarandache, Neutrosophy and Neutrosophic Logic, First International Conference
On Neutrosophy, Neutrosophic Logic, Set, Probability and Statistics University of
New Mexico, Gallup, NM 87301, USA (2002).
11. F.Smarandache, Neutrosophic set, a generialization of the intuituionistics fuzzy sets,
Inter.J.Pure Appl.Math.24 287 297. (2005).
12. Yong Yang and Chenli Ji., Fuzzy soft matrices and their application part I, LNAI
7002; pp:618 627(2011).

International Journal of Innovative Research and Studies

Page 124