Abstract
A Collapsing Knapsack is a container whose capacity diminishes as the number of items it must hold is increased. This paper focuses on those cases in which the decision variables are continuous, i.e., can take any non-negative value. It is demonstrated that the problem can be reduced to a set of two dimensional subproblems. Strategies for elimination of subproblems and conditions permitting reduction to a set of one dimensional problems are also considered.
Computational results indicate that the procedure is quite efficient. Even for large problems only a small number of subproblems have to be solved.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T.C. Hu,Integer programming and network flows (Addison Wesley, Reading, MA 1969).
D. Fayard and G. Plateau, “On the collapsing 0–1 knapsack problem”, contributed paper, Tenth International Symposium on Mathematical Programming, Montreal (August 1979).
M.E. Posner, “The generalized knapsack problem”, Ph.D. Thesis, University of Pennsylvania, Philadelphia, PA (1974).
M.E. Posner, “The decomposition of nonlinear problems,”Mathematical Programming 15 (3) (1978) 360–362.
M.E. Posner, “On the nonlinear decomposition theorem”, Working Paper, University of wisconsin-Milwaukee, Milwaukee, WI (May 1979).
M.E. Posner and M. Guignard, “The 0–1 collapsing knapsack problem,”Mathematical Programming 15 (1978) 155–161.
M.E. Posner and M. Guignard, “The integer collapsing knapsack problem”, Working Paper 80/1-01, University of Wisconsin-Milwaukee, Milwaukee, WI (1980).