| Article ID: | iaor20052320 |
| Country: | India |
| Volume: | 41 |
| Issue: | 2 |
| Start Page Number: | 135 |
| End Page Number: | 142 |
| Publication Date: | Jun 2004 |
| Journal: | OPSEARCH |
| Authors: | Sharma K.C., Bhargava Shifali |
| Keywords: | programming: quadratic |
The integer quadratic knapsack problem having a single constraint was solved in a previous paper, by a projection method that completely eliminated the need for any transformation of variables. Here we present a projection method for general integer quadratic knapsack problem consisting of any finite number of constraints with the help of Kuhn–Tucker conditions and Branch and Bound Method.