There are several methods, in the literature, for solving
linear programming problems with fuzzy cost coecients. In this
paper, a new method is proposed to determine the fuzzy optimal
value of the fuzzy problem under consideration. On the other hand
graph theory has numerous applications to problems in systems anal-
ysis, operations research, transportation, and economics. In many
real world applications, however, some aspects of a graph-theoretic
problem are not deterministic numbers. In these cases, using fuzzy
numbers for modeling the problem is quite appropriate. Here, we
are concerned with nding shortest paths in a graph with fuzzy
cost for every arc. Our main contribution in this paper is to apply
the proposed method for solving fuzzy linear programming prob-
lem to obtain the shortest paths with fuzzy costs in a weighted graph.
کلید واژگان :
Fuzzy linear programming problem; Fuzzy simplex algorithm; Shortest path problem.
