On the weakness of linear programming to interpret the nature of solution of fully fuzzy linear system
© Malkawi et al.; licensee Springer. 2014
Received: 12 December 2013
Accepted: 23 May 2014
Published: 14 July 2014
One of the applications of linear programing is to get solutions for fully fuzzy linear system (FFLS) when the near-zero fuzzy number is considered. This usage could be applied to interpret the nature of FFLS solution according to the nature of FFLS solution in the work of Babbar et al. (Soft Comput. 17:1-12, 2012) and Kumar et al. (Advances in Fuzzy Systems 2011:1-8, 2011). This paper shows that the nature of FFLS solutions must not depend upon the nature of linear programming (LP) solutions, because LP is not enough to obtain all the exact solutions for FFLS which contradicts the claims of researchers. Counter examples are provided in order to falsify those claims. Numerically, we confirm that the nature of the possible way of solving FFLS is completely different from that of the linear system. For instance, FFLS may have two unique solutions which contradict the uniqueness that can be obtained through only one unique solution.
KeywordsFully fuzzy linear system Fuzzy number Near-zero fuzzy number Linear programing
Linear system of equations is the simplest framework and the most beneficial mathematical model for many problems considered by applied mathematics. In practice, unfortunately, the accurate values of coefficients of these systems are not available and not well defined in many applications. This uncertainty may either be probabilistic or non-probabilistic in nature. Accordingly, mathematical tools were developed to represent and deal with vagueness and fuzziness. The response is the fuzzy theory, which provides a widely appreciated tool and representation of these uncertain data in many fields.
Zadeh was the pioneer in the field of fuzzy sets and systems in [,]. The application of this theory, in linear system of equations where the elements of the matrix are crisp numbers and the elements of vector are fuzzy numbers, leads to a new system called fuzzy linear system (FLS). On the other hand, it is called fully fuzzy linear system (FFLS), when the all elements are fuzzy numbers. The problem for solving the fuzzy systems is that, we must use methods without using inverse operators, because the extended operation on fuzzy numbers, subtraction and division of fuzzy numbers are not the inverse operations to addition and multiplication, respectively [,].
Buckley and Qu in [,] discussed the theoretical features of the existence of a solution of fuzzy systems, they provided categories of solution for FFLS as the classical solution X C , the vector solution X J , and the marginal solutions X E and X I . Their methods were generalized in [] to a fuzzy system of equations A1x + b1 = A2 x + b2, where A1, A2, b1, and b2 are fuzzy matrices of fuzzy numbers.
The first achievable approach of FLS was obtained in [], where they proposed a generic model for solving an n × n FLS by employing the embedding approach. The most available study of FFLS was obtained in []; they studied a special case, where all coefficients and parameters are positives. In their study, they declared that there are infinite numbers of scenarios and states that can be constructed from an FFLS. The methods of finding a solution for these scenarios of FFLS create new scenarios of fuzzy system which are based on these actual scenarios of FFLS [].
Dehghan and his colleagues in [-] found the solution for FFLS where the coefficient and parameters are positive; their methods were based on the positivity case in the approximate arithmetic operators on LR fuzzy numbers in []. Furthermore, scholars in [-] and [-] proposed new methods for solving FFLS in a similar case to Dehghan and his colleagues. In [-], researchers generalized methods for solving FFLS where the coefficients and the parameters are not only positive, but they also restrict the signs of coefficient or parameters only to positive or negative in one side of FFLS in an attempt to avoid the near-zero triangular fuzzy numbers in both sides of FFLS. In [], Kumar et al. obtained an exact and infinite positive solution for positive FFLS; moreover, they employed a similar technique to find a positive solution for negative FFLS in []. In [], Malkawi et al. proposed new matrix methods for solving a positive FFLS, the necessary and sufficient condition to have a positive solution was discussed, and their methods and results were also capable of solving left-right fuzzy linear system (LR-FLS) and FLS.
In [], they found approximate solution for FFLS; the near-zero fuzzy numbers are not included. They proposed a numerical method founded by a fuzzy neural network denoted by FNN. The method was restricted by many constraints. The method can solve only when the system has a unique fuzzy solution and the matrix has to be squares which prevent extension of the method to solve a rectangle matrix . To overcome the shortcomings in previous methods, the researchers relied heavily on linear programming (LP) to propose methods that can consider the near-zero triangular fuzzy numbers in both sides of FFLS in [,]. The authors in the two studies declared that the nature of the solutions of the FFLS depends on the nature of the solutions of the LP, i.e., the possible way of solution for FFLS may not be a single unique solution but infinitely many solutions.
Unfortunately, LP can give answers to the linear system but not in FLS and FFLS. The LP technique cannot obtain all feasible solutions for FLS and FFLS. Kumar and his colleagues illustrated examples of one solution while it has two unique fuzzy solutions or infinite number of solutions as will be illustrated through examples in this paper. Also, they added many restrictions to the systems. These restrictions required many steps and longer time to reach the ultimate solution; moreover, their examples did not exceed fuzzy matrix of size n = 2. However, all examples in the literature do not exceed fuzzy matrix of size 2 × 3, if the near-zero LR fuzzy number appears in both hand sides for FFLS.
In this paper, we show that the nature of the solutions of the FFLS is completely different from the nature of the solutions of the LP and that it is insufficient to obtain all exact solutions for FFLS, using numerical examples. We employed the results from this survey as examples for LP methods in specific studies in [,] to declare that the consistency or possible solution for FFLS is not similar to the known consistency concept in the linear system. For instance, the FFLS may yield two unique solutions or many infinite solutions despite that it is constructed by only one equation. Also, the number of solutions in non-square FFLS does not depend on the number of equations compared with the number of parameters.
The structure of this paper is organized as follows: in the ‘Preliminaries’ section, the basic definitions of the fuzzy set theory are provided. In the ‘Fully fuzzy linear system’ section, we intend to illustrate the concept of FFLS, and hence, a brief summary on solving the FFLS using LP technique is provided. The dissection is contained in the ‘Numerical examples’ section where the problems in LP technique are pointed out numerically. In this section, many examples are solved by other methods in the literature or directly by an associated system; however, the verifications of numerical examples are provided. Since the verification of the solutions may be obtained also using distance metric function [], some examples are verified by distance metric function. We provide the final result without considering the used methods because the aim of this paper is to show the weakness of the LP method to detect all exact feasible solutions, and we want to confirm that the nature of solution for LP which has been gained by optimal solution cannot explain the nature of the solution for FFLS. In the ‘Conclusion’ section, we conclude the paper.
Definition 1. Let X be a universal set. Then, we define the fuzzy subset of X by its membership function which assigns to each element x ∈ X a real number in the interval [0,1], where the value represents the grade of membership of x in .
A fuzzy set A is written as .
Definition 3. Let be a fuzzy set defined on the set of real numbers ℝ. Ã is called normal fuzzy set if there exists x ∈ ℝ such that
Definition 4. A fuzzy number is a normal and convex fuzzy set, with its membership function defined in real line ℝ and piecewise continuous.
L(x) = L(−x)
L(0) = 1, L(1) = 0
L is non-increasing on [0, ∞]
Also, the definition of function R(.) which called right shape is similar to that of L(.). It is symbolically written as , where m symbolizes the mean value, while α and β are left and right spreads, respectively. We denote the set of LR fuzzy numbers F(ℜ).
The sign of is classified as follows:
is called positive (negative) iff m − α ≥ 0 (β + m ≤ 0).
is called zero if (m = 0, α, β = 0).
is called near zero iff m − α < 0 < β + m.
Definition 6. Two fuzzy numbers and are called equal, iff (n = m, γ = α, δ = β).
It is symbolically written as a triangular fuzzy number .
In this paper, we used triangular fuzzy number (TFN) in the form (m, α, β), and when a method used the other form (a, b, c), the example rewrites in two forms.
Definition 10. A vector is called a fuzzy vector if
In this paper, if is the fuzzy matrix written in the form (m, a, β), then is the symbol in the form (a, b, c).
(in the form (m, a, β)).
(in the form (a, b, c)).
- 1.(in the form (m, a, β))
- 2.(in the form (a, b, c))
Remark 1. For determining the distance between two fuzzy vectors, the metric proposed in [] for triangular fuzzy number is used.
Fully fuzzy linear system
A brief summary on solving of fully fuzzy linear system using LP technique is provided in this section.
The vector is called exact fuzzy solution if Otherwise, it is called non-fuzzy solution.
Linear programming (LP) of solving FFLS, pioneered by Dehghan et al. in [], is used to solve non-square FFLS for positive coefficients and parameters where the FFLS is not square, or where the size system is n ≥ 5.
In the prior studies, LP technique was employed heavily to solve unrestricted FFLS, where at least one coefficient or parameter is near the zero TFN, because in LP we can add constraints for the system when the proposed method got certain limitations [,,,].
Kumar et al. in [] utilized LP to solve FFLS where the coefficients or parameters are unrestricted in positivity, while Babbar et al. in [] introduced some methods in order to obtain the solution for some states of FFLS, and they used LP to solve the unrestricted parameters, where the coefficients are positive; the LP technique is similar to Kumar et al.'s in [].
In both studies, the authors use LP to interpret the nature of FFLS solutions; the possible solution for FFLS may be no solution, unique, or many infinite solutions. To invalidate that, we take some of the numerical example in these studies and resolve it by original associated linear system for FFLS, and then we find further exact solutions.
Remark 2. The natures of the solutions of the FFLS depend on the nature of the solutions of the LP, i.e., the possible way of solution for FFLS may be no solution or unique, or infinitely many solutions [,].
Because the methods depend on LP, with added further constraints of subject in order to get optimal solution, this leads to more limitations in the final solution. These algorithms find an optimal solution that is an exact solution where the objective function goes to zero. In the following examples, we will show that optimal solution is not necessarily a unique solution like in the linear system, because some or infinite solutions may be omitted and they do not appear in these algorithms.
Moreover, to the best of the researchers' knowledge, all examples which consist near-zero TFN (unrestricted FFLS) in the literature are limited by size to n = 2, but in this paper, we provide two examples of size n = 3.
In order to show the insufficiency in LP in solving FFLS, some examples in this section are discussed. We used the LP technique in Babbar et al. in [] to obtain the algorithm for solving a 1 × 1 FFLS. We find only one solution obtained by the LP technique, while the FFLS has many infinite solutions which is contrary to Remark 2.
In order to show the limitations in LP method, the algorithm is applied in the following numerical examples.
Clearly, the (5, 5, 12) is a non-negative LR fuzzy number. According to [], we can apply their method to solve the system with no restrictions on the solution.
It is clear that the system has infinitely many feasible fuzzy solutions, which is contrary to the nature of possible way solution for the linear system, where every linear system in order 1 × 1 must have a unique solution.
On the other hand, the following Example 4 gives us a different result from Example 3, because it is non-square FFLS, where the number of equations is more than the parameters, and the system has a unique solution.
The following non-square FFLS has many infinite solutions where the number of equations is less than the number of parameters, the result contrary to the result in Example 4.
Some particular solutions:
But it is not a feasible solution, because b3 x ≰ c3 x , then is not a fuzzy vector.
Remark 3. The nature of uniqueness solution or infinity is completely different with the nature of the linear system or linear programing because the number of feasible solutions does not depend on the number of equations compared with number of parameters.
The case of no solution is considered by the following example even when the system has one equation with one parameter, contrary to Example 3 and Example 7.
The solution satisfies the system, but it is not TFN, so it is not considered as a feasible solution
Remark 4. The existence of feasible solution for FFLS is determined by condition of TFN regardless of the existence of the associated system for FFLS.
In light of the previous results, we can declare that the possible ways of solution (unique solutions, infinite solutions, no solution) in FFLS are not determined by the number of equations compared with the number of parameters, or if the FFLS is square or non-square, all possible ways may happen regardless of the number of equations and parameters.
The following examples of FFLS in size n = 1 which is similar with the essential concept of linear system, where the number of equation is equal to the number of parameters, and they have a unique feasible solution.
The following example is an FFLS and has also a unique solution, similar to Example 7, where the size of the coefficient matrix is n = 3.
Where are arbitrary triangular fuzzy numbers.
In the rest of this paper, we will show new facts of the nature of the FFLS solution, which is the unique case that may be assigned two different feasible solutions on the contrary case of uniqueness in the linear system. For that, the LP does not interpret the uniqueness of the FFLS case.
To support that, we take an example from Kumar et al. in [] and obtain further different feasible solutions, while in the proposed method, only one solution is assigned. The triangular fuzzy number in [] is formed in (a, b, c), so Example 9 and Example 10 are rewritten in both forms.
are arbitrary triangular fuzzy numbers.
The solution is considered as identical to solution .
Hence, the FFLS may have unique solutions. In order to enhance that, an example of FFLS in size n = 3 is illustrated with two unique solutions.
Remark 5. The nature of uniqueness in FFLS can be determined by one solution and more, but not infinite number of solutions which is contrary to the essential concept of uniqueness on the linear system that states the determination of only one solution.
The nature of FFLS solution is numerically examined and revealed to be completely different from the linear programing nature of solution because the possible ways of the former solution are different from the possible ways of the linear system (no solution, unique solutions, many infinite solutions). In FFLS, the uniqueness does not happen even in the order of system 1 × 1. Moreover, it has been revealed that uniqueness may happen through more than one solution. The possible ways of solution do not depend upon the number of parameters compared with the number of equations, and the three former possibilities may happen even when they are equal or the number of parameters is greater or less than the number of equations.
The nature of non-fuzzy solution which is equivalent to no solution in the known possible ways of solution is recommended to be considered in the future work, and unlike the result in this paper, the LP and non-linear program (NLP) will be shown to be very effective and sufficient with no exact fuzzy solution, as only one unique approximate solution is needed in order to represent the nearest solution for FFLS; the smallest objective function is considered to be the most optimal solution.
- Zadeh LA: Fuzzy sets. Inf. Control. 1965, 8: 338–353. 10.1016/S0019-9958(65)90241-XMathSciNetView ArticleMATHGoogle Scholar
- Zadeh LA: The concept of a linguistic variable and its application to approximate reasoning–II. Inform. Sci. 1975, 8: 301–357. 10.1016/0020-0255(75)90046-8MathSciNetView ArticleMATHGoogle Scholar
- Allahviranloo T, Mikaeilvand N: Fully fuzzy linear systems solving using MOLP. World Appl. Sci. J. 2011, 12(12):2268–2273.MATHGoogle Scholar
- Allahviranloo T, Mikaeilvand N: Non zero solutions of the fully fuzzy linear systems. Appl. Comput. Math. 2011, 10(2):271–282.MathSciNetMATHGoogle Scholar
- Buckley J: Solving fuzzy equations in economics and finance. Fuzzy Sets Syst. 1992, 48: 289–296. 10.1016/0165-0114(92)90344-4MathSciNetView ArticleMATHGoogle Scholar
- Buckley J, Qu Y: Solving systems of linear fuzzy equations. Fuzzy Sets Syst. 1991, 43: 33–43. 10.1016/0165-0114(91)90019-MMathSciNetView ArticleMATHGoogle Scholar
- Muzziolia S, Reynaertsb H: Fuzzy linear systems of the form A1x + b1= A 2 x + b 2 . Fuzzy Sets Syst. 2006, 157: 939–951. 10.1016/j.fss.2005.09.005View ArticleGoogle Scholar
- Friedman M, Ming M, Kandel A: Fuzzy linear systems. Fuzzy Sets Syst. 1998, 96: 201–209. 10.1016/S0165-0114(96)00270-9MathSciNetView ArticleMATHGoogle Scholar
- Dehghan M, Hashemi B: Iterative solution of fuzzy linear systems. Appl. Math. Comput. 2006, 175: 645–674. 10.1016/j.amc.2005.07.033MathSciNetMATHGoogle Scholar
- Kumar A, Neetua , Bansalb A: A new method to solve fully fuzzy linear system with trapezoidal fuzzy numbers. Can. J. Sci. Eng. Math. 2010, 1(3):45–56.Google Scholar
- Dehghan M, Hashemi B: Solution of the fully fuzzy linear systems using the decomposition procedure. Appl. Math. Comput. 2006, 182: 1568–1580. 10.1016/j.amc.2006.05.043MathSciNetMATHGoogle Scholar
- Dehghan M, Hashemi B, Ghatee M: Computational methods for solving fully fuzzy linear systems. Appl. Math. Comput. 2006, 179: 328–343. 10.1016/j.amc.2005.11.124MathSciNetMATHGoogle Scholar
- Dehghan M, Hashemi B, Ghatee M: Solution of the fully fuzzy linear systems using iterative techniques. Chaos Solitons Fractals 2007, 34: 316–336. 10.1016/j.chaos.2006.03.085MathSciNetView ArticleMATHGoogle Scholar
- Dubois D, Prade H: Operations on fuzzy numbers. Int. J. Syst. Sci. 1978, 9(6):613–626. 10.1080/00207727808941724MathSciNetView ArticleMATHGoogle Scholar
- Abbasbandy S, Hashemi MS: Solving fully fuzzy linear systems by using implicit Gauss–Cholesky algorithm. Comput. Math. Model. 2012, 1: 535–541.MathSciNetMATHGoogle Scholar
- Gao J, Zhang QA, Gao J, Zhang Q: A unified iterative scheme for solving fully Fuzzy linear system. Glob. Congr. Intell. Syst. 2009, 1: 431–435.Google Scholar
- Malkawi, G, Ahmad, N, Ibrahim, H: A note on “Solving fully fuzzy linear systems by using implicit Gausscholesky algorithm”. Comput. Math. Model. (2014). in pressGoogle Scholar
- Mosleh M, Otadi M, Khanmirzaie A: Decomposition method for solving fully fuzzy linear systems. Iran. J. Opt. 2009, 1: 188–198.Google Scholar
- Nasseri SH, Zahmatkesh F: Huang method for solving fully Fuzzy linear system of equations. J. Math. Comput. Sci. 2010, 1(1):1–5.MATHGoogle Scholar
- Nasseri SH, Sohrabi M, Ardil E: Solving fully fuzzy linear systems by use of a certain decomposition of the coefficient Matrix. Int. J. Comput. Math. Sci. 2008, 3: 140–142.MathSciNetGoogle Scholar
- Nasseri S, Sohrabi M: Cholesky decomposition for solving the fully fuzzy linear system of equations. Int. J. Appl. Math. 2009, 22(5):689–696.MathSciNetMATHGoogle Scholar
- Nasseri S, Matinfar M, Kheiri Z: Greville's method for the fully fuzzy linear system of equations. Adv. Fuzzy Sets Syst. 2009, 4: 301–3011.MathSciNetMATHGoogle Scholar
- Nasseri S, Taleshian F, Behmanesh E, Sohrabi M: A Qr-decomposition of the mean value matrix of the coefficient matrix for solving the fully fuzzy linear system. Int. J. Appl. Math. 2012, 25: 473–480.MathSciNetMATHGoogle Scholar
- Ezzati R: Solving fuzzy linear systems. Soft. Comput. 2011, 15: 193–197. 10.1007/s00500-009-0537-7MathSciNetView ArticleMATHGoogle Scholar
- Ezzati R, Khezerloo S, Yousefzadeh A: Solving fully fuzzy linear system of equations in general form. J. Fuzzy Set Val. Anal. 2012, 2012: 1–11. 10.5899/2012/jfsva-00117MathSciNetView ArticleGoogle Scholar
- Kumar A, Bansal N: Solution of fully fuzzy linear system with arbitrary coefficients. Int. J. Appl. Math. Comput. 2011, 3(3):232–237.Google Scholar
- Liu H–K: On the solution of fully fuzzy linear systems. Int. J. Comput. Math. Sci. 2010, 4(1):29–33.MathSciNetGoogle Scholar
- Kumar A, Neetu Bansal A: A new computational method for solving fully fuzzy linear systems of triangular fuzzy numbers. Fuzzy Inf. Eng. 2012, 4(1):63–73. 10.1007/s12543-012-0101-5MathSciNetView ArticleMATHGoogle Scholar
- Kumar A, Babbar N: A new computational method to solve fully fuzzy linear systems for negative coefficient matrix. Int. J. Manuf. Technol. Manag. 2012, 25: 19–23.Google Scholar
- Malkawi G, Ahmad N, Ibrahim H: Solving fully fuzzy linear system with the necessary and sufficient condition to have a positive solution. Appl. Math. 2014, 8(3):1003–1019.MathSciNetGoogle Scholar
- Otadi M, Mosleh M, Abbasbandy S: Numerical solution of fully fuzzy linear systems by fuzzy neural network. Soft. Comput. 2011, 15: 1513–1522. 10.1007/s00500-010-0685-9View ArticleMATHGoogle Scholar
- Babbar N, Kumar A, Bansal A: Solving fully fuzzy linear system with arbitrary triangular fuzzy numbers ( m , a , β ). Soft. Comput. 2012, 17(4):1–12.Google Scholar
- Kumar A, Neetu B, Kumar A, Neetu , Bansal A: A new approach for solving fully fuzzy linear systems. Adv. Fuzzy Syst. 2011, 2011: 1–8. 10.1155/2011/943161MathSciNetView ArticleMATHGoogle Scholar
- Malkawi, G, Ahmad, N, Ibrahim, H: A note on the nearest symmetric fuzzy solution for a symmetric fuzzy linear system. An. St. Univ. Ovidius Constanta (2014). in press Malkawi, G, Ahmad, N, Ibrahim, H: A note on the nearest symmetric fuzzy solution for a symmetric fuzzy linear system. An. St. Univ. Ovidius Constanta (2014). in press
- Dubois D, Prade H: Systems of linear fuzzy constraints. Fuzzy Sets Syst. 1980, 3: 37–48. 10.1016/0165-0114(80)90004-4MathSciNetView ArticleMATHGoogle Scholar
- Kaufmann A, Gupta M: M: Introduction to Fuzzy. Van Nostrand Reinhold, New York, NY, USA; 1991.MATHGoogle Scholar
- Ming M, Friedman M, Kandel A: General fuzzy least squares. Fuzzy Sets Syst. 1997, 88: 107–118. 10.1016/S0165-0114(96)00051-6MathSciNetView ArticleMATHGoogle Scholar
- Otadi M, Mosleh M: Solving fully fuzzy matrix equations. Appl. Math. Model. 2012, 36(12):6114–6121. 10.1016/j.apm.2012.02.005MathSciNetView ArticleMATHGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.