Metode Bound and Decomposition untuk Menyelesaikan Permasalahan Program Linier Fuzzy Penuh

Abstract

The assumption of certainty about the values of the parameters in the decision making problem which is modeled with linear programming in real world systems are too complex to be defined. Then to overcome this uncertainty applied the fuzzy set theory on linear programming that called as Fuzzy Linear Programming. This Fuzzy Linear Programming is continue to be developed till formed Fully Fuzzy Linear Programming that all values of the parameters are fuzzy numbers. In this paper told a method to finding an optimal solution to Fully Fuzzy Linear Programming for trapezoidal fuzzy is Bound and Decomposition Method. The Fully Fuzzy Linear Programming problem is decomposed into four Crisp Linear programming (CLP) problems with bounded variabels constraints. The four CLP problems are solved separately using simplex method and the optimal solution which obtained becoming an optimal solution for Fully Fuzzy Liner Programming problem.