A successive domain-reduction scheme for linearly constrained quadratic integer programming problems

Fenlan Wang

Journal of the Operational Research Society, 2021, vol. 72, issue 10, 2317-2330

Abstract: A new exact solution method is developed in this paper for solving nonseparable linearly constrained quadratic integer programming problems with convex, concave or indefinite objective functions. By exploiting the special characteristics of the quadratic contour and examining the neighboring integer points of the continuous optimal solution from the continuous relaxation problem that discards the integer constraint of the original problem, cut off these sub-boxes which do not contain any optimal solution of the original problem. Integrating such solution scheme into a branch-and-bound algorithm, the proposed solution method reduces the optimality gap successively in the solution iterations. Furthermore, the proposed solution method is of a finite-step convergence, as domain cut is valid in each iteration.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2020.1784047 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:72:y:2021:i:10:p:2317-2330

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2020.1784047

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().