Solving fuzzy linear programming problems by using the fuzzy exponential barrier method

In order to resolve the fuzzy linear programming problem, the fuzzy exponential barrier approach is the major strategy employed in this article. To overcome the problems with fuzzy linear programming, this method uses an algorithm. In this concept, a fuzzy inequality constraint is produced since the objective functions are convex.numerical examples are provided

AN ALGORITHM FOR SOLVING INTUITIONISTIC FUZZY LINEAR BOTTLENECK ASSIGNMENT PROBLEMS

The linear bottleneck assignment problem (LBAP), which is a variation of the classical assignment problem, seeks to minimize the longest completion time rather than the sum of the completion times when a number of jobs are to be assigned to the same number of workers. If the completion times are not certain, then it is said to be a fuzzy LBAP. Here we propose a new algorithm to solve fuzzy LBAP with completion times as intuitionistic fuzzy numbers

On Antipodal Fuzzy Graph

Abstract In this paper the isometry between two fuzzy graphs is defined. Nature of the isometry relation and concepts regarding isomorphism and isometry is discussed. Antipodal fuzzy graph of the given fuzzy graph is defined. When the given fuzzy graph is either complete or strong, the nature of its antipodal fuzzy graph is discussed. Isomorphism concept for the antipodal fuzzy graphs is also studied. Mathematics Subject Classification: 03E72, 05C12, 05C9

P A A NEW AVERAGE METHOD FOR SOLVING INTUITIONISTIC FUZZY TRANSPORTATION PROBLEM

Abstract: In this paper a new average method is proposed for finding an optimal solution for an intuitionistic fuzzy transportation problem. The main feature of this method is that it requires very simple arithmetical calculations and avoids large number of iterations. An accuracy function to defuzzify Triangular Intuitionistic Fuzzy Number is also used. Based on this new approach, the optimal solution of Intuitionistic Fuzzy transportation problem is obtained. Finally, an illustrative example is given to verify the developed approach

Properties of Fuzzy Labeling Graph

Abstract In this paper a new concept of fuzzy labeling is introduced. A graph is said to be a fuzzy labeling graph if it has fuzzy labeling. Fuzzy sub graph, union, fuzzy bridges, fuzzy end nodes, fuzzy cut nodes and weakest arc of fuzzy labeling graphs have been discussed. And number of weakest arc, fuzzy bridge, cut node and end node of a fuzzy labeling cycle has been found. It is proved that ∆ (G ω ) is a fuzzy cut node and δ(G ω ) is a fuzzy end node of fuzzy labeling graph. Also it is proved that If G ω is a connected fuzzy labeling graph then there exists a strong path between any pair of nodes. Mathematics Subject Classification: 03E72, 05C72, 05C7

2 – Bondage Number of a Fuzzy Graph

In this paper, 2-bondage set of a fuzzy graph G is dened. The2-bondage number, b2(G) is the minimum cardinality among all 2-bondage sets of G. The condition for a 2-bondage set of a fuzzy graph to be a bondage set is also given. The exact values of b2(G) is determined for several classes of fuzzy graphs

Mixed Constraint Fuzzy Transshipment Problem

Abstract In this paper, a Fuzzy Transshipment problem is defined in which the origin and destination consist not only the equality but also of greater than or equal to or less than or equal to type constraints. An algorithm is proposed to change the mixed constraint fuzzy transshipment problem into a standard fuzzy transportation problem. The optimal solution for the fuzzy transportation problem is the optimal solution for the mixed constraint fuzzy transshipment problem

Inner Product over Fuzzy Matrices

The purpose of this study was to introduce the inner product over fuzzy matrices. By virtue of this definition, α-norm is defined and the parallelogram law is proved. Again the relative fuzzy norm with respect to the inner product over fuzzy matrices is defined. Moreover Cauchy Schwarz inequality, Pythagoras, and Fundamental Minimum Principle are established. Some equivalent conditions are also proved