Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 626
The multiple-choice nested knapsack problem (MCKP) is a generalization of the ordinary knapsack problem, where the set of items is partitioned into classes. The binary choice of selecting an item is replaced by taking exactly one item out of each class of items. Due to the fact that the MCKP is an NP-hard integer program dual prices are not readily available. In this paper we propose a family of linear programming models the optimal solution of which is integral for many instances. The models are evaluated experimentally using a well-defined testbed consisting of 9,000 instances. Overall our methodology produces an integral solution for 75% of the instances considered. In particular, for two out of five distribution types studied at least one of the models produces "almost always" an integral solution. Hence, in most of the cases there exists a linear price function that supports the optimal allocation.
Knapsack problem multiple-choice constraints integer programming duality linear programming pricing