In this paper, we focus on multiobjective linear programming problems involving fuzzy numbers with the block angular structure and examine the efficiency of the Dantzig Wolfe decomposition method in the interactive fuzzy satisficing method proposed by the authors. After overviewing the interactive fuzzy satisficing method, three objective linear programming problems with 15 coupling constraints are considered. Through many computational experiments on numerical examples with both 50 and 200 variables, the advantages of the Dantzig Wolfe decomposition method over the revised simplex method are discussed with respect to processing time and required memory storage.
['Masatoshi Sakawa', 'Kosuke Kato', 'Hideki Mohara']
EFFICIENCY OF DECOMPOSITION METHOD FOR STRUCTURED MULTIOBJECTIVE LINEAR PROGRAMMING PROBLEMS WITH FUZZY NUMBERS