# A New Approach for Solving Fully Fuzzy Linear Systems

Authors: Amit  Kumar; Neetu; Abhinav Bansal
Journal: Advances in Fuzzy Systems
 (2011)

---

## Abstract

Several authors have proposed different methods to find the solution of fully fuzzy linear systems (FFLSs) that is, fuzzy linear system with fuzzy coefficients involving fuzzy variables. But all the existing methods are based on the assumption that all the fuzzy coefficients and the fuzzy variables are nonnegative fuzzy numbers. In this paper a new method is proposed to solve an FFLS with arbitrary coefficients and arbitrary solution vector, that is, there is no restriction on the elements that have been used in the FFLS. The primary objective of this paper is thus to introduce the concept and a computational method for solving FFLS with no non negative constraint on the parameters. The method incorporates the principles of linear programming in solving an FFLS with arbitrary coefficients and is not only easier to understand but also widens the scope of fuzzy linear equations in scientific applications. To show the advantages of the proposed method over existing methods we solve three FFLSs.


---

## Body

## 1. Introduction

One field of applied mathematics that has many applications in various areas of science is solving a system of linear equations. Systems of simultaneous linear equations play a major role in various areas such as operational research, physics, statistics, engineering, and social sciences. When the estimation of the system coefficients is imprecise and only some vague knowledge about the actual values of the parameters is available, it may be convenient to represent some or all of them with fuzzy numbers [1]. Fuzzy number arithmetic is widely applied and useful in computation of linear system whose parameters are represented by fuzzy numbers, which are called fuzzy linear systems (FLSs). Buckley and Qu [2] defined the concept of solving fuzzy equations and their work has been influential in the study of fuzzy linear systems. A general model for solving an n×n fuzzy linear system whose coefficient matrix is crisp and the right-hand side column is an arbitrary fuzzy vector was first proposed by Friedman et al. [3, 4]. Later some numerical methods to solve similar systems were proposed [5] and extended methods like successive overrelaxation [6] adomian decomposition [7] were also presented. Abbasbandy et al. also described LU decomposition method [8], Conjugate Gradient method [9], and Steepest descent method [10] for solving such system of fuzzy equations. Some iterative methods to solve an FLS were also extended in [11]. The condition of crispness of the coefficient matrix makes all these methods restricted with negligible applications.In addition, another important kind of fuzzy linear systems are the fully fuzzy linear systems (FFLS) in which all the parameters are fuzzy numbers. Dehghan and Hashemi [12, 13] proposed the Adomian decomposition method, and other iterative methods to find the positive fuzzy vector solution of n×n fully fuzzy linear system. Dehghan et al. [14] proposed some computational methods such as Cramer’s rule, Gauss elimination method, LU decomposition method and linear programming approach for finding the approximated solution of FFLS. Muzzioli and Reynaerts [15] introduced an algorithm to find vector solution by transforming the system A1x+b1=A2x+b2 into the FFLS Ax=b where A=A1-A2  and b=b2-b1.Mosleh et al. [16] proposed a method to find the solution of fully fuzzy linear system of the form Ax+b=Cx+d with A, C being square matrices of fuzzy coefficients and b, d being fuzzy number vectors, and the unknown vector x is vector consisting of nfuzzy numbers. Nasseri et al. [17] used  certain decomposition methods of the coefficient matrix for solving fully fuzzy linear system of equations. Allahviranloo et al. [18] proposed a numerical method for solving FFLS Ax=b,when coefficient matrix is positive. Gao [19] proposed a unified iterative scheme for solving nonsquare FFLS with nonnegative constraints.Nasseri et al. [20] proposed Greville’s method to find the positive solution of FFLS. Mosleh et al. [21] discussed symmetric times triangular (ST) decomposition to find the positive solution of FFLS. Nasseri and Zahmatkesh [22] proposed a new method for computing the nonnegative solution of FFLS. Liu [23] developed a block homotopy perturbation method (HPM) for finding the approximation of the solution of FFLS. Nasseri and Sohrabi [24] used a certain decomposition of the coefficient matrix of the FFLS to construct a new algorithm for solving FFLS. Kumar et al. [25] proposed a new method to find the approximate solution of FFLS with trapezoidal fuzzy numbers as parameters. Recently some other methods like homotopy perturbation, splitting methods and other numerical methods have been proposed in [26–29] but possess similar restrictions for solving fuzzy systems. It may be seen that the methods assume the nonnegativity of the coefficients.In this paper, a new method based upon the decomposition of an FFLS into a nonlinear system and subsequently a linear programming problem, is proposed to find the solution of FFLS without any restriction on coefficient and fuzzy variables. To illustrate the proposed method numerical examples are solved. The rest of paper is organized as follows. In Section2, some basic definitions and arithmetic operations of triangular fuzzy numbers are reviewed. In Section 3, limitations of the existing methods to solve FFLS are described. In Section 4, a new computational method for solving FFLS with arbitrary coefficient matrix and arbitrary fuzzy variable is introduced. In Section 5, to exemplify the method three FFLSs are solved. The paper is concluded in Section 6.


## 2. Preliminaries

### 2.1. Basic Definitions

In this section some basic definitions of fuzzy set theory are reviewed [30, 31].Definition 1.
A fuzzy numberÃ is said to be nonnegative fuzzy number if the domain of its membership function is a set of nonnegative real numbers (R+), that is, μÃ:R+→[0,1]. The set of nonnegative fuzzy numbers may be represented by F(R+).Definition 2.
A fuzzy numberÃ is said to be unrestricted fuzzy number if the domain of its membership function is a set of real numbers (R), that is,μÃ:R→[0,1]. The set of unrestricted fuzzy numbers may be represented by F(R).Definition 3.
A fuzzy numberÃ=(a,b,c) is said to be a triangular fuzzy number if its  membership function is given by
(1)μÃ(x)={0,x<a,x-ab-a,a≤x≤b,c-xc-b,b<x≤c,0,x>c,
where a,b,c∈R.Definition 4.
A triangular fuzzy number;Ã=(a,b,c)is said to be unrestricted triangular fuzzy number if a,b,c∈R.Definition 5.
A triangular fuzzy numberÃ=(a,b,c)is said to be nonnegative triangular fuzzy number; that is, Ã≥0, that is, if and only if a≥0.Definition 6.
A triangular fuzzy numberÃ=(a,b,c)is said to be zero triangular fuzzy number if and only if a=0, b=0, and c=0.Definition 7.
Two triangular fuzzy numbersÃ1=(a,b,c) and Ã2=(e,f,g) are said to be equal; that is, Ã1=Ã2 if and only if a=e, b=f, and c=g.Definition 8.
A matrixÃ=(ãij) is called a fuzzy matrix, if each element of Ã is a fuzzy number. Ãwill be positive (negative) and denoted by Ã>0  (Ã<0) if each element of Ã positive (negative). Ãwill nonpositive (nonnegative) and denoted by Ã≤0  (Ã≥0) if each element of Ã be nonpositive (nonnegative). We may represent n×m fuzzy matrix Ã=(ãij)n×m where ãij=(aij,bij,cij).Definition 9.
LetÃ=(ãij) and B̃=(b̃ij) be two m×n and n×p fuzzy matrices. We define Ã⊗B̃=C̃=(c̃ij)  which is the m×p matrix where c̃ij=∑k=1,…,n⨁ãik⊗b̃kj.


### 2.2. Arithmetic Operations on Triangular Fuzzy Numbers

In this subsection addition and multiplication operations between two triangular fuzzy numbers are reviewed [30, 31].LetÃ1=(a,b,c) and Ã2=(e,f,g)  be two triangular fuzzy  numbers; then one has the following.(i)
Ã1⊕Ã2=(a,b,c)⊕(e,f,g)=(a+e,b+f,c+g)(ii)
Ã1⊖Ã2=(a,b,c)⊖(e,f,g)=(a-g,b-f,c-e)(iii)
IfÃ1 and Ã2 be two nonnegative triangular fuzzy numbers then
(2)Ã1⊗Ã2=Ã2⊗Ã1=(ae,bf,cg).Remark 10.
LetÃ=(a,b,c) and X̃=(x,y,z) be two unrestricted triangular fuzzy numbers. Then
(3)(a,b,c)⊗(x,y,z)={min⁡⁡(ax,cx),by,max⁡⁡(az,cz)if(a,b,c)≥0,thatis,ifa≥0,min⁡⁡(az,cz),by,max⁡⁡(ax,cx)if(a,b,c)≤0,thatis,ifc≤0,min⁡⁡(az,cx),by,max⁡⁡(cz,ax)otherwise,thatis,ifa≤0≤c.Remark 11.
In this paper, minimum and maximum are represented by “min” and “max”, respectively, where(4)min⁡⁡(x,y)=(x+y2)-|x-y2|,max⁡⁡(x,y)=(x+y2)+|x-y2|.


## 2.1. Basic Definitions

In this section some basic definitions of fuzzy set theory are reviewed [30, 31].Definition 1.
A fuzzy numberÃ is said to be nonnegative fuzzy number if the domain of its membership function is a set of nonnegative real numbers (R+), that is, μÃ:R+→[0,1]. The set of nonnegative fuzzy numbers may be represented by F(R+).Definition 2.
A fuzzy numberÃ is said to be unrestricted fuzzy number if the domain of its membership function is a set of real numbers (R), that is,μÃ:R→[0,1]. The set of unrestricted fuzzy numbers may be represented by F(R).Definition 3.
A fuzzy numberÃ=(a,b,c) is said to be a triangular fuzzy number if its  membership function is given by
(1)μÃ(x)={0,x<a,x-ab-a,a≤x≤b,c-xc-b,b<x≤c,0,x>c,
where a,b,c∈R.Definition 4.
A triangular fuzzy number;Ã=(a,b,c)is said to be unrestricted triangular fuzzy number if a,b,c∈R.Definition 5.
A triangular fuzzy numberÃ=(a,b,c)is said to be nonnegative triangular fuzzy number; that is, Ã≥0, that is, if and only if a≥0.Definition 6.
A triangular fuzzy numberÃ=(a,b,c)is said to be zero triangular fuzzy number if and only if a=0, b=0, and c=0.Definition 7.
Two triangular fuzzy numbersÃ1=(a,b,c) and Ã2=(e,f,g) are said to be equal; that is, Ã1=Ã2 if and only if a=e, b=f, and c=g.Definition 8.
A matrixÃ=(ãij) is called a fuzzy matrix, if each element of Ã is a fuzzy number. Ãwill be positive (negative) and denoted by Ã>0  (Ã<0) if each element of Ã positive (negative). Ãwill nonpositive (nonnegative) and denoted by Ã≤0  (Ã≥0) if each element of Ã be nonpositive (nonnegative). We may represent n×m fuzzy matrix Ã=(ãij)n×m where ãij=(aij,bij,cij).Definition 9.
LetÃ=(ãij) and B̃=(b̃ij) be two m×n and n×p fuzzy matrices. We define Ã⊗B̃=C̃=(c̃ij)  which is the m×p matrix where c̃ij=∑k=1,…,n⨁ãik⊗b̃kj.


## 2.2. Arithmetic Operations on Triangular Fuzzy Numbers

In this subsection addition and multiplication operations between two triangular fuzzy numbers are reviewed [30, 31].LetÃ1=(a,b,c) and Ã2=(e,f,g)  be two triangular fuzzy  numbers; then one has the following.(i)
Ã1⊕Ã2=(a,b,c)⊕(e,f,g)=(a+e,b+f,c+g)(ii)
Ã1⊖Ã2=(a,b,c)⊖(e,f,g)=(a-g,b-f,c-e)(iii)
IfÃ1 and Ã2 be two nonnegative triangular fuzzy numbers then
(2)Ã1⊗Ã2=Ã2⊗Ã1=(ae,bf,cg).Remark 10.
LetÃ=(a,b,c) and X̃=(x,y,z) be two unrestricted triangular fuzzy numbers. Then
(3)(a,b,c)⊗(x,y,z)={min⁡⁡(ax,cx),by,max⁡⁡(az,cz)if(a,b,c)≥0,thatis,ifa≥0,min⁡⁡(az,cz),by,max⁡⁡(ax,cx)if(a,b,c)≤0,thatis,ifc≤0,min⁡⁡(az,cx),by,max⁡⁡(cz,ax)otherwise,thatis,ifa≤0≤c.Remark 11.
In this paper, minimum and maximum are represented by “min” and “max”, respectively, where(4)min⁡⁡(x,y)=(x+y2)-|x-y2|,max⁡⁡(x,y)=(x+y2)+|x-y2|.


## 3. Limitations of the Existing Methods

In this section, the limitations of the existing methods, for example, [2, 5–14, 17–29] are pointed out.(1)
The existing methods can be applied only for finding the solution of ann×nFFLS in which all the elements are nonnegative fuzzy numbers; that is, the existing methods presume the nonnegativity of the coefficient matrix and the solution vector. This restriction creates difficulty in using the existing methods to solve an FFLS occurring in real life situations as the nature of the unknown quantity cannot be knowna priori and there exist several instances in real scenarios where the coefficients may not be entirely positive or nonnegative. The primary aim of this paper is to eliminate this restriction and to propose a concept and a computational paradigm to solve a fuzzy-based system of simultaneous equations without any nonnegative restrictions.(2)
There exist several methods like [5–11] that restrict the coefficient matrix to be crisp matrix and such systems are not fully fuzzy. Such systems will be entirely spanned by fully fuzzy linear systems. Some of the methods include α-cuts to solve fuzzy linear equations which can be computationally simplified by using triangular fuzzy numbers as it is easier to operate with constants than variables.(3)
Using the existing methods it is not possible to check whether the obtained solution is unique or not. There may be several cases where the FFLS may generate trivial, unique or infinitely many solutions.To overcome the above shortcomings, in Section4, a new computational method is proposed for solving an FFLS with triangular fuzzy numbers.


## 4. Proposed Method

In this section, a new method is proposed to solve a fully fuzzy linear system with no restrictions on the parameters.The steps of the proposed method are as follows.Step 1.
SubstitutingÃ=(ãij)m×n, x̃=(x̃j)n×1, and B̃=(B̃i)m×1 the m×n FFLS Ã⊗x̃=B̃, may be written as
(5)∑j=1,…,n⊕ãij⊗x̃j=B̃i∀i=1,2,…,m.Step 2.
If all the parametersãij, x̃j, andb̃i are represented by triangular fuzzy numbers (aij,bij,cij), (xj,yj,zj), and (Bi,Gi,Hi), respectively, then the FFLS, obtained in Step 1, may be written as
(6)∑j=1,…,n⊕(aij,bij,cij)⊗(xj,yj,zj)=(Bi,Gi,Hi),∀i=1,2,…,m.Step 3.
Assuming(aij,bij,cij)⊗(xj,yj,zj)=(fij,pij,qij), the FFLS, obtained in Step 2, may be written as
(7)∑j=1,…,n⊕(fij,pij,qij)=(Bi,Gi,Hi)∀i=1,2,…,m,
where
(8)(fij,pij,qij)=(aij,bij,cij)⊗(xj,yj,zj).
As ãij and x̃j are both arbitrary fuzzy numbers, the above product can be defined in three subcases.Case 1.
If(aij,bij,cij)≥0, that is, aij≥0,
(9)(fij,pij,qij)=((aij+cij2)xj-(cij-aij2)|xj|,bijyj,(aij+cij2)zj+(cij-aij2)|zj|).
Using Definition 7, the above equation may be written as,
(10)fij=(aij+cij2)xj-(cij-aij2)|xj|,pij=bijyj,qij=(aij+cij2)zj+(cij-aij2)|zj|.
To solve this system we define variables xj′ and xj′′ as
(11)xj′={xjifxj>0,0otherwise,xj′′={-xjifxj<0,0otherwise.
Hence substitute xj=xj′-xj′′  and  |xj|=xj′+xj′′; similarly define variables zj′ and zj′′; substitute zj=zj′-zj′′ and |zj|=zj′+zj′′ where xj′, xj′′, zj′, zj′′≥0.Therefore we obtain the following linear system of equation:
(12)fij=(aij+cij2)(xj′-xj′′)-(cij-aij2)(xj′+xj′′),pij=bijyj,qij=(aij+cij2)(zj′-zj′′)+(cij-aij2)(zj′+zj′′).Case 2.
If(aij,bij,cij)≤0, that is, cij≤0,
(13)(fij,pij,qij)=((aij+cij2)zj-(cij-aij2)|zj|,bijyj,(aij+cij2)xj+(cij-aij2)|xj|).
This can be similarly reduced as follows.
Puttingxj=xj′-xj′′ and |xj|=xj′+xj′′, zj=zj′-zj′′, and |zj|=zj′+zj′′, where xj′, xj′′, zj′, zj′′≥0. Thus(14)fij=(aij+cij2)(zj′-zj′′)-(cij-aij2)(zj′+zj′′),pij=bijyj,qij=(aij+cij2)(xj′-xj′′)+(cij-aij2)(xj′+xj′′).Case 3.
If(aij,bij,cij)≈0, that is, aij<0<cij,
(15)(fij,pij,qij)=((aijzj+cijxj2)-|cijxj-aijzj2|,bijyj,(aijxj+cijzj2)+|cijzj-aijxj2|).
Using Definition 5, the above equation may be written as
(16)fij=(aijzj+cijxj2)-|cijxj-aijzj2|,pij=bijyj,qij=(aijxj+cijzj2)+|cijzj-aijxj2|.
This can be further reduced as follows.
Puttingxj=xj′-xj′′  and  |xj|=xj′+xj′′, zj=zj′-zj′′ and |zj|=zj′+zj′′, cijxj-aijzj=uij′-uij′′ and |cijxj-aijzj|=uij′+uij′′, cijzj-aijxj=vij′-vij′′ and |cijzj-aijxj|=vij′+vij′′, where xj′, xj′′, zj′, zj′′, uij′, uij′′, vij′, vij′′≥0.
On simplifying we obtain(17)fij=(aij(zj′-zj′′)+cij(xj′-xj′′)2)-(uij′+uij′′2),pij=bijyj,qij=(aij(xj′-xj′′)+cij(zj′-zj′′)2)+(vij′+vij′′2).Step 4.
Having broken down the FFLS from Step3 into a set of linear equations, rewrite the given system as:
(18)(∑j=1nfij,∑j=1npij,∑j=1nqij)=(Bi,Gi,Hi)∀i=1,2,…,m.
Or equivalently
(19)∑j=1nfij=Bi;i=1,2,…,m,∑j=1npij=Gi;i=1,2,…,m,∑j=inqij=Hi;i=1,2,…,m,
with appropriate constraints obtained from Step 3.Step 5.
In order to solve the system obtained in Step4 we decompose the FFLS into an equivalent linear programming problem LPP. For notational convenience we construct the following step functions:
(20)ε1(Ã=(a,b,c))={1ifÃ≥0,thatis,a≥0,0otherwiseε2(Ã=(a,b,c))={1ifÃ≤0,thatis,c<0,0otherwiseε3(Ã=(a,b,c))={1ifÃ≈0,thatis,a<0<c,0otherwise.
The equivalent LPP can thus be directly written as:
Minimize(21)R̅=∑i=1mRi+∑i=1mRi′+∑i=1mRi′′
subject to the following constraints.
First Set of Constraints:(22)∑j=1nbijyj+Ri=Gi,i=1,2,…,m.
Second Set of Constraints:
(23)∑j=1nε1(ãij)(aijxj′-cijxj′′)+∑j=1nε2(ãij)(aijzj′-cijzj′′)+∑j=1nε3(ãij)(0.5(aij(zj′-zj′′)+cij(xj′-xj′′))-0.5(uij′+uij′′))+Ri′=Bi∀i=1,2,…,m.
Third Set of Constraints:
(24)∑j=1nε1(ãij)(cijzj′-aijzj′′)+∑j=1nε2(ãij)(cijxj′-aijxj′′)+∑j=1nε3(ãij)(0.5(cij(zj′-zj′′)+aij(xj′-xj′′))+0.5(vij′+vij′′))+Ri′′=Hi.∀i=1,2,…,m.
Fourth Set of Constraints:
(25)ε3(ãij)(cijxj-aijzj-uij′+uij′′)=0,i=1,2,…m,j=1,2,…,n.
Fifth Set of Constraint:
(26)ε3(ãij)(cijzj-aijxj-vij′+vij′′)=0,i=1,2,…m,j=1,2,…,n.
Nonnegative Constraint:
(27)xj′,xj′′,ε3(ãij)uij′,ε3(ãij)uij′′,ε3(ãij)vij′,ε3(ãij)vij′′,zj′,zj′′,Ri,Ri′,Ri′′≥0,i=1,2,…m,j=1,2,…,n.Step 6.
Solve the above LPP and put the above values in(28)x̃j=(xj′-xj′′,yj,zj′-zj′′)∀j=1,2,…,n,
to find the solution of FFLS. The solution would be termed as (feasible) strong fuzzy solution if yj-xj′+xj′′≥0 and zj′-zj′′-yj≥0. Otherwise the solution would be termed as (infeasible) weak fuzzy solution.Remark 12.
The necessary condition for the above LPP to generate a feasible solution is that the value of the objective functionR must be zero, that is, ∑i=1mRi+∑i=1mRi′+∑i=1mRi′′=0.Remark 13.
The sufficient conditions for the solution to be termed as a strong (feasible) solution fori=1,2,…m, j=1,2,…,n, are as follows:(1)
yj-xj′+xj′′≥0 and zj′-zj′′-yj≥0,(2)
xj′·xj′′=uij′·uij′′=vij′·vij′′=zj′·zj′′=R=0.Remark 14.
The nature of the solutions of the FFLS depends upon the nature of the solutions of the LPP which may be unique, trivial, or infinitely many, that is, the FFLS may yield no solution, unique solution, or infinitely many solutions.Remark 15.
The decomposition of them×n FFLS results into an LPP with a minimum number of 3m constraints (when all the coefficients are either nonnegative or nonpositive) and a maximum number of  3m+2mn constraints (when all the coefficients are neither negative nor positive).


## 5. Numerical Example

In this section, to illustrate the proposed method and also to show the advantages of the proposed method we solve three FFLSs. We take two FFLSs which cannot be solved by any of the available methods in the literature due to the restrictions imposed by the methods. Also, we solve one FFLSs randomly chosen from literature and apply our method to show that the proposed method can equivalently solve the examples from literature. Hence the FFLS that we solve belong to the following categories:(1)
a square FFLS with unrestricted fuzzy variables,(2)
a nonsquare FFLS with unrestricted fuzzy variables that generates infinite solutions,(3)
a square FFLS with restriction of crispness of the coefficient matrix randomly chosen from the literature [5].Example 1.
Solve the following FFLS by the proposed method:(29)[(-2,3,4)(-2,2,3)(1,2,2)(4,4,5)][x̃1x̃2]=[(-13,8,14)(-14,8,14)],
where x̃1 and x̃2 are arbitrary triangular fuzzy numbers.Solution 1.
Step 1.
The chosen FFLS is as follows:(30)(-2,3,4)⊗x̃1⊕(-2,2,3)⊗x̃2=(-13,8,14),(1,2,2)⊗x̃1⊕(4,4,5)⊗x̃2=(-14,8,14),
where x̃1,x̃2 are unrestricted triangular fuzzy numbers.Step 2.
Assumingx̃1=(x1,y1,z1) and x̃2=(x2,y2,z2) the FFLS, chosen in Step 1, may be written as
(31)(-2,3,4)⊗(x1,y1,z1)⊕(-2,2,3)⊗(x2,y2,z2)=(-13,8,14),(1,2,2)⊗(x1,y1,z1)⊕(4,4,5)⊗(x2,y2,z2)=(-14,8,14),
where (x1,y1,z1) and (x2,y2,z2) are unrestricted triangular fuzzy numbers.Step 3.
Using Step3 we may obtain (fij,pij,qij) as follows:
(32)(f11,p11,q11)=(-2,3,4)⊗(x1,y1,z1),f11=(a11(z1′-z1′′)+c11(x1′-x1′′)2)-(u11′+u11′′2),p11=b11y1,q11=(a11(x1′-x1′′)+c11(z1′-z1′′)2)+(v11′+v11′′2).
Or we may have
(33)p11=3y1,f11=-2(z1′-z1′′)+4(x1′-x1′′)2-(u11′+u11′′2),q11=4(z1′-z1′′)-2(x1′-x1′′)2+(v11′+v11′′2),
with two additional constraints:
(34)2(z1′-z1′′)+4(x1′-x1′′)-u11′+u11′′=0,2(x1′-x1′′)+4(z1′-z1′′)-v11′+v11′′=0.
Similarly we obtain the other coefficients as
(35)p12=2y2,f12=-2(z2′-z2′′)+3(x2′-x2′′)2-(u12′+u12′′2),q12=3(z2′-z2′′)-2(x2′-x2′′)2+(v12′+v12′′2),
with two additional equations:
(36)2(z2′-z2′′)+3(x2′-x2′′)-u12′+u12′′=0,2(x2′-x2′′)+3(z2′-z2′′)-v12′+v12′′=0,p21=2x1,f21=x1′-2x1′′,q21=2z1′-z1′′,p22=4x2,f22=4x2′-5x2′′,q22=5z2′-4z2′′.Step 4.
Using Step4 of the proposed method the FFLS obtained in Step 3 may be written as
(37)3y1+2y2=8,2y1+4y2=8,f11+f12=-13,f21+f22=-14,q11+q12=14,q21+q22=14.Step 5.
Convert the system of equation as a linear programming problem as follows.
MinimizeR=R1+R2+R1′+R2′+R1′′+R2′′subject to the following 10 constraints:(38)3y1+2y2+R1=8,2y1+4y2+R2=8,-z1′+z1′′+2x1′-2x1′′-0.5u11′-0.5u11′′-z2′+z2′′+1.5x2′-1.5x2′′-0.5u12′-0.5u12′′+R1′=-13,x1′-2x1′′+4x2′-5x2′′+R2′=-14,2z1′-2z1′′-x1′+x1′′+0.5v11′+0.5v11′′+1.5z2′-1.5z2′′-x2′+x2′′+0.5v12′+0.5v12′′+R1′′=14,2z1′-z1′′+5z2′-4z2′′+R2′′=14,2(z1′-z1′′)+4(x1′-x1′′)-u11′+u11′′=0,2(x1′-x1′′)+4(z1′-z1′′)-v11′+v11′′=0,2(z2′-z2′′)+3(x2′-x2′′)-u12′+u12′′=0,2(x2′-x2′′)+3(z2′-z2′′)-v12′+v12′′=0,x1′,x1′′,x2′,x2′′,u11′,u11′′,v11′,v11′′,z1′,z1′′,z2′,z2′′,u12′,u12′′,v12′,v12′′,R1,R2,R1′,R2′,R1′′,R2′′≥0.
On solving the above LPP, we gety1=2, y2=1, x1′=1, x1′′=0, u11′=8, u11′′=0, v11′=10, v11′′=0, x2′=0, x2′′=3, z1′=2, z1′′=0, z2′=2, z2′′=0, u12′=0, u12′′=5, v12′=0, v12′′=0, R1=0, R2=0, R1′=0, R2′=0, R1′′=0, and R2′′=0.Step 6.
Put the values ofxj′, xj′′, zj′, zj′′, yj, obtained from Step 5, in x̃j=(xj′-xj′′,yj,zj′-zj′′) for all j=1,2,…,n. We find the solution of FFLS as
(39)x̃1=(1,2,2),x̃2=(-3,1,2).
Clearly, the FFLS has a feasible and a strong fuzzy solution.Example 2.
Solve the following2×3 FFLS:
(40)[(1,2,3)(-2,-1,-1)(2,3,4)(-3,-2,-1)(2,4,5)(3,4,5)][x̃1x̃2x̃3]=[(-7,0,8)(-26,-10,-4)].Solution 2.
Clearly this is a nonsquare FFLS with arbitrary triangular fuzzy numbers as coefficients and hence cannot be solved by any of the existing methods. We apply our method to solve this system.
Rewrite the FFLS as(41)(1,2,3)⊗(x1,y1,z1)⊕(-2,-1,-1)⊗(x2,y2,z2)⊕(2,3,4)⊗(x3,y3,z3)=(-7,0,8),(-3,-2,-1)⊗(x1,y1,z1)⊕(2,4,5)⊗(x2,y2,z2)⊕(3,4,5)⊗(x3,y3,z3)=(-26,-10,-4).
Using the proposed method we obtain the following LPP:
MinimizeR=R1+R2+R1′+R2′+R1′′+R2′′ subject to the following 6 constraints:(42)2y1-y2+3y3+R1=0,-2y1+4y2+4y3+R2=-10,x1′-3x1′′-2z2′+z2′′+2x3′-4x3′′+R1′=-7,3z1′-z1′′-x2′+2x2′′+4z3′-2z3′′+R1′′=8,-3z1′+z1′′+2x2′-5x2′′+3x3′-5x3′′+R2′=-26,-x1′+3x1′′+5z2′-2z2′′+5z3′-3z3′′+R2′′=-4,x1′,x1′′,x2′,x2′′,x3′,x3′′,y1′,y1′′,y2′,y2′′,y3′,y3′′,R1,R2,R1′,R2′,R1′′,R2′′≥0.
The above LPP on solving by traditional algebra yields many solutions and one of the feasible solutions isy1=1, y2=-1, y3=-1, x1′=1, x1′′=0, x2′=0, x2′′=2, x3′=0, x3′′=2, z1′=2, z1′′=0, z2′=0, z2′′=0, z3′=0, z3′′=1, R1=0, R2=0, R1′=0, R2′=0, R1′′=0, and R2′′=0.
Put the values ofxj′, xj′′, zj′, zj′′, yjobtained from Step 5, in x̃j=(xj′-xj′′,yj,zj′-zj′′) for all j=1,2,…,n. we find the solution of FFLS as(43)x̃1=(1,1,2),x̃2=(-2,-1,0),x̃3=(-2,-1,-1).
Clearly, the obtained solution is a feasible (strong) fuzzy solution.Example 3.
Solve the following2×2 fuzzy system randomly taken from [5]:
(44)x1-x2=(r,2-r),x1+3x2=(4+r,7-2r).Solution 3.
The fuzzy linear system is based upon the concept ofα-cuts and has assumed restricted nature of FFLS by considering the coefficients crisp rather than fuzzy. We first convert this system into an FFLS with triangular fuzzy numbers and solve it by the proposed method to obtain the same result. The above system can be rewritten as
(45)[(1,1,1)(-1,-1,-1)(1,1,1)(3,3,3)][x̃1x̃2]=[(0,1,2)(4,5,7)],
wherex̃1 and x̃2 are arbitrary triangular fuzzy numbers.
Assumingx̃1=(x1,y1,z1) and x̃2=(x2,y2,z2), the FFLS may be written as(46)(1,1,1)⊗(x1,y1,z1)⊕(-1,-1,-1)⊗(x2,y2,z2)=(0,1,2),(1,1,1)⊗(x1,y1,z1)⊕(3,3,3)⊗(x2,y2,z2)=(4,5,7),
where (x1,y1,z1) and (x2,y2,z2) are unrestricted triangular fuzzy numbers.
Using the proposed method we obtain the following LPP.
MinimizeR=R1+R2+R1′+R2′+R1′′+R2′′ subject to the following 6 constraints:
(47)y1-y2+R1=1,y1+3y2+R2=5,x1′-x1′′-z2′+z2′′+R1′=0,x1′-x1′′+3x2′-3x3′′+R2′=4,z1′-z1′′-x2′+x2′′+R1′′=2,z1′-z1′′+3z2′-3z2′′+R2′′=7,x1′,x1′′,x2′,x2′′,y1′,y1′′,y2′,y2′′,R1,R2,R1′,R2′,R1′′,R2′′≥0.
The above LPP on solving by traditional algebra yields the following solution: y1=2, y2=1, x1′=1.375, x1′′=0, x2′=0.875, x2′′=0, z1′=2.875, z1′′=0, z2′=1.375, z2′′=0, R1=0, R2=0, R1′=0, R2′=0, R1′′=0, and R2′′=0.
Substituting the values ofxj′, xj′′, zj′, zj′′, yj, obtained from Step 5, in x̃j=(xj′-xj′′,yj,zj′-zj′′) for all j=1,2,…,n we find the solution of FFLS as(48)x̃1=(1.375,2,2.875),x̃2=(0.875,1,1.375).
Clearly, the obtained solution is exactly the same as in [5] and is clearly feasible.


## 6. Conclusion

In this paper, we propose a new method for solving FFLS with arbitrary coefficients that not only overcomes the limitations of the several existing methods available in the literature like [2, 5–14, 17–29] but also amplifies the scope of incorporating fuzzy linear equation in real scenarios. The proposed method can successfully solve the following types of FFLS: (i)
FFLS having nonnegative fuzzy coefficients and nonnegative fuzzy variables,(ii)
FFLS having nonnegative fuzzy coefficients and unrestricted fuzzy variables,(iii)
FFLS having unrestricted fuzzy coefficients and nonnegative fuzzy variables,(iv)
FFLS having unrestricted fuzzy coefficients and unrestricted fuzzy variables,(v)
Fuzzy linear systems with crisp coefficient matrix and unrestricted fuzzy variables.The numerical examples that are solved in Section5 clearly demonstrate that the proposed method can solve FFLS with arbitrary coefficients as well as FFLS with nonnegative and other several types of restrictions. The proposed method thus fruitfully removes the constraints that are imposed by researchers and is therefore better to use in several engineering and scientific applications. However a future work still remains to evolve methods with improved computational complexity and to solve an arbitrary FFLS with nonlinear membership functions.



---

*Source: 943161-2011-06-22.xml*