Abstract
The quadratic knapsack problem (QKP) maximizes a quadratic objective function subject to a binary and linear capacity constraint. Due to its simple structure and challenging difficulty, it has been studied intensively during the last two decades. This paper first presents some global optimality conditions for (QKP), which include necessary conditions and sufficient conditions. Then a local optimization method for (QKP) is developed using the necessary global optimality condition. Finally a global optimization method for (QKP) is proposed based on the sufficient global optimality condition, the local optimization method and an auxiliary function. Several numerical examples are given to illustrate the efficiency of the presented optimization methods.
Similar content being viewed by others
References
Gallo, G., Hammer, P.L., Simeone, B.: Quadratic knapsack problems. Math. Program. 12, 132–149 (1980)
Pisinger, D.: The quadratic knapsack problem—a survey. Discrete Appl. Math. 155, 623–648 (2007)
Witzgall, C.: Mathematical methods of site selection for electronic message system (EMS). Technical Report, NBS Internal Report (1975)
Rhys, J.: A selection problem of shared fixed costs and network flows. Manag. Sci. 17, 200–207 (1970)
Johnson, E., Mehrotra, A., Nemhauser, G.: Min-cut clustering. Math. Program. 62, 133–152 (1993)
Billionnet, A., Faye, A., Soutif, E.: A new upper bound for the 0-1 quadratic knapsack problem. Eur. J. Oper. Res. 112, 664–672 (1999)
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)
Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)
Pisinger, D., Toth, P.: Knapsack problems. In: Du, D., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, pp. 1–89. Kluwer Academic, Dordrecht (1998)
Billionnet, A., Soutif, E.: An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem. Eur. J. Oper. Res. 157, 565–575 (2004)
Gallo, G., Simeone, B.: On the supermodular knapsack problems. Math. Program. 45, 295–309 (1988)
Hammer, P.L., Rader, D.J.: Efficient methods for solving quadratic 0-1 knapsack problems. Inf. Syst. Oper. Res. 35, 170–182 (1997)
Michelon, P., Veilleux, L.: Lagrangean methods for the 0-1 quadratic knapsack problem. Eur. J. Oper. Res. 92, 326–341 (1996)
Xie, X.F., Liu, J.M.: A mini-swarm for the quadratic knapsack problem. In: IEEE Swarm Intelligence Symposium (SIS), Honolulu, HI, USA, pp. 190–197 (2007)
Caprara, A., Pisinger, D., Toth, P.: Exact solution of the quadratic knapsack problem. INFORMS J. Comput. 11, 125–137 (1999)
Billionnet, A., Calmels, F.: Linear programming for the 0-1 quadratic knapsack problem. Eur. J. Oper. Res. 92, 310–325 (1996)
Helmberg, C., Rendl, F., Weismantel, R.: Quadratic knapsack relaxations using cutting planes and semidefinite programming. In: Cunningham, W., McCormick, S., Queyranne, M. (eds.) Proceedings of the Fifth IPCO Conference. Lecture Notes in Computer Science, vol. 1084, pp. 175–189. Springer, Berlin (1996)
Rader, D.J., Woeginger, G.J.: The quadratic {0,1} knapsack problem with series-parallel support. Oper. Res. Lett. 30, 159–166 (2002)
Beck, A., Teboulle, M.: Global optimality conditions for quadratic optimization problems with binary constraints. SIAM J. Optim. 11, 179–188 (2000)
Jeyakumar, V., Rubinov, A.M., Wu, Z.Y.: Sufficient global optimality conditions for non-convex quadratic optimization problems with box constraints. J. Glob. Optim. 36, 471–481 (2006)
Pinar, M.C.: Sufficient global optimality conditions for bivalent quadratic optimization. J. Optim. Theory Appl. 122, 443–440 (2004)
Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., Gumus, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of Test Problems in Local and Global Optimization. Kluwer Academic, Dordrecht (1999)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Masao Fukushima.
Rights and permissions
About this article
Cite this article
Wu, Z.Y., Yang, Y.J., Bai, F.S. et al. Global Optimality Conditions and Optimization Methods for Quadratic Knapsack Problems. J Optim Theory Appl 151, 241–259 (2011). https://doi.org/10.1007/s10957-011-9885-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-011-9885-4