PENYELESAIAN PROGRAM LINIER FUZZY TIDAK PENUH DENGAN ALGORITMA SIMPLEKS FUZZY

Abstract

A generalized simplex algorithm is proposed for solving a special type of fuzzy linear programming (FLP) problems. This generalized simplex algorithm belong to extention from classical simplex algorithm. To determine Entering variable (EV) or Leaving variable (LV) in simplex table can be used rank function. This final task discuss about simplex algorithm to finish not full FLP with number of trapezoidal generalized fuzzy. Standart form trapezoidal generalized fuzzy that is (a,b,c,d;w) where 𝑤 ∈ [0,1]. A generalized simplex algorithm can be used to get optimal fuzzy solution from not full fuzzy linear program problems with unequal constraint. Fuzzy optimal solution obtained from the simplex algorithm is the same value on trapezoidal fuzzy numbers for any chosen of value 𝑤. Keywords : Fuzzy linear programming, trapezoidal generalized fuzzy, simplex algorithm