Abstract
In bag-packing problem one must decide which hoppers to open to achieve desired weight with a computerized scale. To find the right combination one should convert the problem into a constraint satisfaction problem. By solving its problem using enumerative method, one can simulate the bag-packing process with a computerized scale. Then, one can conclude that its solution reduces to the one which is far from desired weight in a special case, and also that the special case is determined by average and variance of all hoppers' weight.
