Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
 Page 1 /100 Display every page 5 10 20 Item
 Yugoslav Journal of Operations Research , 2012, DOI: 10.2298/yjor110522001s Abstract: In our earlier articles, we proposed two methods for solving the fully fuzzified linear fractional programming (FFLFP) problems. In this paper, we introduce a different approach of evaluating fuzzy inequalities between two triangular fuzzy numbers and solving FFLFP problems. First, using the Charnes-Cooper method, we transform the linear fractional programming problem into a linear one. Second, the problem of maximizing a function with triangular fuzzy value is transformed into a problem of deterministic multiple objective linear programming. Illustrative numerical examples are given to clarify the developed theory and the proposed algorithm.
 Advances in Fuzzy Systems , 2011, DOI: 10.1155/2011/943161 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. 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 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,
 International Journal of Applied Operational Research , 2011, Abstract: As can be seen from the definition of extended operations on fuzzy numbers, subtraction and division of fuzzy numbers are not the inverse operations to addition and multiplication . Hence, to solve the fuzzy equations or a fuzzy system of linear equations analytically, we must use methods without using inverse operators. In this paper, a novel method to find the solutions in which 0 is not the inner point of supports, of fully fuzzy linear systems (shown as FFLS ) is proposed, if they exist by an analytic approach. The system's parameters were splitted into two groups of nonpositive and nonnegative by solving a multi objective linear programming problem, MOLP , and employing an embedding method to transform n× n FFLS to 2n× 2n parametric form linear system and hence, transforming operations on fuzzy numbers to operations on functions. And finally, numerical examples are used to illustrate this approach. Keywords: Fuzzy Numbers, Fully Fuzzy Linear System, Systems of Fuzzy Linear Equations, Embedding Method, Splitting Method.
 Journal of Fuzzy Set Valued Analysis , 2012, DOI: 10.5899/2012/jfsva-00117 Abstract: In this work, we propose an approach for computing the positive solution of a fully fuzzy linear system where the coefficient matrix is a fuzzy \$nimes n\$ matrix. To do this, we use arithmetic operations on fuzzy numbers that introduced by Kaffman in and convert the fully fuzzy linear system into two \$nimes n\$ and \$2nimes 2n\$ crisp linear systems. If the solutions of these linear systems don't satisfy in positive fuzzy solution condition, we introduce the constrained least squares problem to obtain optimal fuzzy vector solution by applying the ranking function in given fully fuzzy linear system. Using our proposed method, the fully fuzzy linear system of equations always has a solution. Finally, we illustrate the efficiency of proposed method by solving some numerical examples.
 Christian Drescher Computer Science , 2010, Abstract: In the context of answer set programming, this work investigates symmetry detection and symmetry breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We contribute a reduction of symmetry detection to a graph automorphism problem which allows to extract symmetries of a logic program from the symmetries of the constructed coloured graph. We also propose an encoding of symmetry-breaking constraints in terms of permutation cycles and use only generators in this process which implicitly represent symmetries and always with exponential compression. These ideas are formulated as preprocessing and implemented in a completely automated flow that first detects symmetries from a given answer set program, adds symmetry-breaking constraints, and can be applied to any existing answer set solver. We demonstrate computational impact on benchmarks versus direct application of the solver. Furthermore, we explore symmetry breaking for answer set programming in two domains: first, constraint answer set programming as a novel approach to represent and solve constraint satisfaction problems, and second, distributed nonmonotonic multi-context systems. In particular, we formulate a translation-based approach to constraint answer set solving which allows for the application of our symmetry detection and symmetry breaking methods. To compare their performance with a-priori symmetry breaking techniques, we also contribute a decomposition of the global value precedence constraint that enforces domain consistency on the original constraint via the unit-propagation of an answer set solver. We evaluate both options in an empirical analysis. In the context of distributed nonmonotonic multi-context system, we develop an algorithm for distributed symmetry detection and also carry over symmetry-breaking constraints for distributed answer set programming.
 S. Radhakrishnan Bonfring International Journal of Man Machine Interface , 2012, DOI: 10.9756/bijmmi.1237 Abstract: System of simultaneous linear equations plays a vital role in mathematics, Operations Research, Statistics, Physics, Engineering and Social Sciences etc. In many applications at least some of the system?s parameters and measurements are represented by fuzzy numbers rather than crisp numbers. Therefore it is imperative to develop mathematical models and numerical procedures to solve such a fuzzy linear system. The general model of a fuzzy linear system whose coefficient matrix is crisp and the right hand side column is an arbitrary fuzzy vector. In the fully fuzzy linear system all the parameters are considered to be fuzzy numbers. Since triangular fuzzy numbers is a special case of trapezoidal fuzzy numbers, hence in this paper we considered fully fuzzy linear system with trapezoidal fuzzy numbers. LU decomposition method for a crisp matrix is well known in solving linear system of equations. We discuss LU decomposition of the coefficient matrix of the fully fuzzy linear system, in which the coefficients are trapezoidal fuzzy numbers.
 Ali Ebrahimnejad Applied Mathematics (AM) , 2011, DOI: 10.4236/am.2011.26089 Abstract: Two existing methods for solving a class of fuzzy linear programming (FLP) problems involving symmetric trapezoidal fuzzy numbers without converting them to crisp linear programming problems are the fuzzy primal simplex method proposed by Ganesan and Veeramani [1] and the fuzzy dual simplex method proposed by Ebrahimnejad and Nasseri [2]. The former method is not applicable when a primal basic feasible solution is not easily at hand and the later method needs to an initial dual basic feasible solution. In this paper, we develop a novel approach namely the primal-dual simplex algorithm to overcome mentioned shortcomings. A numerical example is given to illustrate the proposed approach.
 Journal of Fuzzy Set Valued Analysis , 2011, DOI: 10.5899/2011/jfsva-00102 Abstract: Ganesan and Veeramani [Fuzzy linear programs with trapezoidal fuzzy numbers, Annals of Operations Research 143 (2006) 305-315.] proposed a new method for solving a special type of fuzzy linear programming problems. In this paper a new method, named as Mehar's method, is proposed for solving the same type of fuzzy linear programming problems and it is shown that it is easy to apply the Mehar's method as compared to the existing method for solving the same type of fuzzy linear programming problems.
 International Journal of Intelligence Science (IJIS) , 2019, DOI: 10.4236/ijis.2019.94006 Abstract: Under non-random uncertainty, a new idea of finding a possibly optimal solution for linear programming problem is examined in this paper. It is an application of the intuitionistic fuzzy set concept within scope of the existing fuzzy optimization. Here, we solve a linear programming problem (LPP) in an intuitionistic fuzzy environment and compare the result with the solution obtained from other existing techniques. In the process, the result of associated fuzzy LPP is also considered for a better understanding.
 Mathematics , 2014, Abstract: In this paper, notion of p - norm generalized trapezoidal intuitionistic fuzzy numbers is introduced. A new ranking method is introduced for p - norm generalized trapezoidal intuitionistic fuzzy numbers. Also we consider linear programming problem in intuitionistic fuzzy environment. In this problem, all the coefficients and variables are represented by p - norm generalized trapezoidal intuitionistic fuzzy numbers. To overcome the limitations of the existing methods, a new method is proposed to compute the intuitionistic fuzzy optimal solution for intuitionistic fuzzy linear programming problem. An illustrative numerical example is solved to demonstrate the efficiency of the proposed approach.
 Page 1 /100 Display every page 5 10 20 Item