Extension of primal simplex algorithm for solving minimum cost network flow problem with fuzzy multi-objective function

In this paper we focus on solving minimum fuzzy cost network flow problem that is the most fundamental of all fuzzy network flow problems. This problem may be stated as follows: Ship the available supply through the network to satisfy demand at minimum fuzzy cost. Minimum fuzzy cost network flow problems might arise in a logistics network where people and materials are being moved between various points in the world. Clearly, the minimum fuzzy cost flow problem can be solved by fuzzy primal simplex algorithm which is discussed by some researcher. Here, we first introduce the specialization of the fuzzy primal simplex algorithm to network structured fuzzy linear programming problems. This specialization, known as the network fuzzy simplex algorithm, performs the simplex operations directly on the network without the need of a simplex tableau and then, we give an extension of primal simplex algorithm for solving minimum cost network flow problem with fuzzy multi-objective.

کلیدواژه ها:

Multiobjective programming ، Fuzzy programming ، minimum cost network flow problem ، primal simplex algorithm