We consider efficient algorithms for combinatorial
optimization problems arising in automatic
double-layered food packing
equipments. The first and second layers
consist of $n$ weighing hoppers and
$n$ booster hoppers, respectively.
Some amount of foods is thrown
into each hopper,
and is called an item. The equipment
performs an operation of
choosing a subset $I