| Article ID: | iaor19991487 |
| Country: | Netherlands |
| Volume: | 95 |
| Issue: | 1 |
| Start Page Number: | 231 |
| End Page Number: | 236 |
| Publication Date: | Nov 1996 |
| Journal: | European Journal of Operational Research |
| Authors: | Puri M.C., Gupta Renu, Bandopadhyaya Lakshmisree |
| Keywords: | programming: integer |
The present paper develops an algorithm for ranking the integer feasible solutions of a quadratic integer programming (QIP) problem. A linear integer programming problem is constructed which provides bounds on the values of the objective function of the quadratic problem. The integer feasible solutions of this related integer linear programming problem are systemically scanned to rank the integer feasible solutions of the quadratic problem in non-decreasing order of the objective function values. The ranking in the QIP problem is useful in solving a nonlinear integer programming problem in which some other complicated nonlinear restrictions are imposed which cannot be included in the simple linear constraints of QIP, the objective function being still quadratic.