Abstract
The fractional knapsack problem to obtain an integer solution that maximizes a linear fractional objective function under the constraint of one linear inequality is considered. A modification of the Dinkelbach's algorithm [3] is proposed to exploit the fact that good feasible solutions are easily obtained for both the fractional knapsack problem and the ordinary knapsack problem. An upper bound of the number of iterations is derived. In particular it is clarified how optimal solutions depend on the right hand side of the constraint; a fractional knapsack problem reduces to an ordinary knapsack problem if the right hand side exceeds a certain bound.
This is a preview of subscription content, log in via an institution to check access.
References
Y. Anzai, “On integer fractional programming”,Journal of Operations Research Society of Japan 17 (1974) 49–66.
A. Charnes and W.W. Cooper, “Programming with linear fractional functionals”,Naval Research Logistics Quarterly 9 (1962) 181–196.
W. Dinkelbach, “On nonlinear fractional programming”,Management Science 13 (1967) 492–498.
S.E. Elmaghraby and S. Arisawa, “On hyperbolic programming with a single constraint and upper-bounded variables”,Management Science 19 (1972) 42–45.
R.S. Garfinkel and G.L. Nemhauser,Integer programming (Wiley, New York, 1972).
P.C. Gilmore and R.E. Gomory, “The theory and computation of knapsack functions”,Operations Research 14 (1966) 1045–1074.
M. Gruspan, “Hyperbolic integer programming”,Naval Research Logistics Quarterly 20 (1973) 341–356.
P.L. Hammer and S. Rudeanu,Boolean methods in operations research and related areas (Springer, Berlin, 1968).
T.C. Hu and M.L. Lenard, “A study of a heuristic algorithm”, MRC Tech. Rept. No. 1370, The University of Wisconsin — Madison Mathematics Research Center, Madison, WI (July, 1973).
R. Jagannathan, “On some properties of programming problems in parametric forms pertaining to fractional programming”,Management Science 12 (1966) 609–615.
M.J. Magazine, G.L. Nemhauser and L.E. Trotter, “When the greedy solution solves a class of knapsack problems”,Operations Research 23 (1975) 207–217.
B. Martos, “Hyperbolic programming”,Naval Research Logistics Quarterly 11 (1964) 135–155.
P. Robillard, “(0, 1) hyperbolic programming problems”,Naval Research Logistics Quarterly 18 (1971) 47–57.
S. Sahni, “Approximate algorithms for the 0/1 knapsack problem”,Journal of the Association for Computing Machinery 22 (1975) 115–124.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ishii, H., Ibaraki, T. & Mine, H. Fractional knapsack problems. Mathematical Programming 13, 255–271 (1977). https://doi.org/10.1007/BF01584342
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584342