다분할(多分割) 선형배낭문제(線型背囊問題)

The multi-divisional linear knapsack problem

The multi-divisional knapsack problem is defined as a binary knapsack problem where each of mutually exclusive divisions has its own capacity. We consider the relaxed LP problem and develop a transformation which converts the multi-divisional linear knapsack problem into smaller size linear knapsack problems. Solution procedures and a numerical example are presented.