In a computerized scale, several products having different weights are packaged together so that the sum weight should be closest to a given target weight. The problem is how to overcome trade-off conflict occurring in solving combinatorial optimization with constraint satisfied. Therefore, we propose a new objective function, that is different from the original one, and both of them are combined with a tuning parameter. By varying this tuning parameter, such an optimal solution is obtained that suits user's needs in the meaning of Pareto optimum.