Efficiency of decomposition method for structured multiobjective linear programming problems with fuzzy numbers

In this paper, we focus on multiobjective linear programming problems invol ving fuzzy numbers with the block angular structure and examine the efficie ncy of the Dantzig-Wolfe decomposition method in the interactive fuzzy sati sficing method proposed by the authors. After overviewing the interactive f uzzy satisficing method, thrice objective linear programming problems with 15 coupling constraints are considered. Through many computational experime nts 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.