Application of Possibility Programming in Analysis of Fuzzy Knapsack Problems

This paper investigates knapsack problems in which all of the weight coefficients in the objective function and in the constraints are fuzzy numbers. Also, the knapsack’s capacity is not known exactly and is represented by a fuzzy number. The approach in this paper for dealing with this kind of problems is based on Buckley’s concept. But, instead of trying to obtain the possibility distribution, we try to solve the problem with a given possibility level. As a result, we can compare this approach with signed distance ranking method that was used for defuzzifying fuzzy knapsack problem by Lin and Yao [3].

کلیدواژه ها:

Fuzzy number ، possibility theory ، knapsack problem ، Multiple choice knapsack problem ، Multi contraint 0/1 knapsack problem ، Multiple criteria knapsack problem