Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem |
| |
Authors: | Richard J. Forrester Warren P. Adams Paul T. Hadavas |
| |
Affiliation: | 1. Department of Mathematics, Dickinson College, Carlisle, Pennsylvania;2. Department of Mathematical Sciences, Clemson University, Clemson, South Carolina;3. Department of Mathematics, Armstrong Atlantic State University, Savannah, Georgia |
| |
Abstract: | The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restrictions, which are subsequently linearized. For special problem forms, the structure of these linearized constraints tends to suggest that certain classes may be more beneficial than others. We examine the usefulness of subsets of constraints for a family of 0–1 quadratic multidimensional knapsack programs and perform extensive computational tests on a classical special case known as the 0–1 quadratic knapsack problem. We consider RLT forms both with and without these inequalities, and their comparisons with linearizations derived from published methods. Interestingly, the computational results depend in part upon the commercial software used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 |
| |
Keywords: | 0– 1 quadratic knapsack problem linearization reformulation‐linearization technique (RLT) |
|
|