Optimization and Reoptimization in Fuzzy Linear Programming problems

Fuzzy Linear Programming models are quite frequent in practice. The dynamic nature of the real problems often requires reoptimize from the optimal solutions found, what may mean a significant consumption of time and funds. In this paper, in order to efficiently solve this problem, first the optimality conditions and the duality results for fully fuzzy linear programming problems (all parameters and variables are symmetric trapezoidal fuzzy numbers) are generalized. Then, one proposes a fuzzy dual simplex method for solving these problems without the need of converting them to conventional linear programming problems. The resulting algorithm is flexible and easy of applying. For the sake of illustration, finally, an easy example is solved.