Knapsack problem has been widely studied due to its broad applications in many fields of science. Dealing with imprecise data arises in many real world applications. A study report is presented to comprehend the problem and its many variants for suitable applicability. A revised method considering possibility and necessity factors to work with imprecise data and to support different levels of optimization along with repetitiveness in solution is proposed. A fuzzy model is proposed to deal with imprecise parameters whose de-fuzzification gives a standard constraint optimization problem which is solved using genetic algorithm. The work proposes to extend the standard solution to find whether accepted level of profit can be achieved and for allowing multiple instances of the same object in the solution. The results of genetic optimization over two different solution paths are analyzed and better performance is achieved.