1995 Volume 7 Issue 1 Pages 142-152
In this paper, we expand the network simplex algorithm for solving network structured linear programming problems. This algorithm performs the simplex operations directly on the graph or network itself. We expand this algorithm bymeans of a fuzzilize and multiplize of objective functions. And we apply this expanded algorithm to a shortest path problems with two objective functions suchas cost and time. The numerical example is also given, and it shows that the algorithm is very efficeint and effective with respect to the real world network problems under the computer configurations.
