A generalisation of an algorithm solving the fuzzy multiple choice knapsack problem

It is shown that the solution method presented in the Okada and Gen paper can be applied to a much broader class of fuzzy multiple choice knapsack problems than that it is suggested in the original paper. Okada and Gen assume that the fuzzy coefficients in the objective function and in the constraint are pairwise comparable according to a rather strong relation, the same one for the objective and the constraint coefficients. Here, it is shown that the Okada and Gen algorithm can be applied also if the pairwise comparability of the coefficients is assured by some weaker relations, and what is more, not necessarily the same ones for the objective and the constraint.