Please use this identifier to cite or link to this item:
|Title:||Efficient Algorithms for Solving Some Fuzzy Network Flow Problems|
|Keywords:||Fuzzy Linear Programming;Network Flow Problems|
|Abstract:||In this thesis, shortcomings and limitations of existing methods for solving fuzzy maximum flow problems (maximum flow problems in which each arc capacity is represented by a fuzzy number) as well as the shortcomings and the limitations of the existing methods for solving fully fuzzy capacitated minimum cost flow problems (capacitated minimum cost flow problems in which all the parameters as well as the decision variables are represented by fuzzy numbers) are pointed out. To overcome the limitations of the existing methods as well as to resolve the shortcomings of the existing methods, new methods are proposed for solving fuzzy maximum flow problems, fully fuzzy single objective capacitated minimum cost flow problems, fully fuzzy multi-objective capacitated minimum cost flow problems, fully fuzzy multi-objective capacitated solid minimum cost flow problems and intuitionistic fully fuzzy single and multi-objective capacitated solid minimum cost flow problems.|
|Description:||Doctor of Philosophy (Mathematics)|
|Appears in Collections:||Doctoral Theses@SOM|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.