A Polyhedral Study of the Cardinality Cosntrained Knapsack Problem

I.R. de Farias (defariascore.ucl.ac.be)
G.L. Nemhauser (george.nemhauserisye.gatech.edu)

Abstract: A cardinality constrained knapsack problem is a continuous knapsack problem in which no more than a specified number of nonnegative variables are allowed to be positive. This structure occurs, for example, in areas as finance, location, and scheduling. Traditionally, cardinality constraints are modeled by introducing auxiliary 0-1 variables and additional constraints that relate the continuous and the 0-1 variables. We use an alternative approach, in which we keep in the model only the continuous variables, and we enforce the cardinality constraint through a specialized branching scheme and the use of strong inequalities valid for the convex hull of the feasible set in the space of the continuous variables. To derive the valid inequalities, we extend the concepts of cover and cover inequality, commonly used in 0-1 programming to this class of problems, and we show how cover inequalities can be lifted to derive facet-defining inequalities. We present three families of non-trivial facet-defining inequalities that are lifted cover inequalities. Finally, we report computational results that demonstrate the effectiveness of lifted cover inequalities and the superiority of the approach of not introducing auxiliary 0-1 variables over the traditional MIP approach for this class of problems.

Keywords: mixed-integer programming, knapsack problem, cardinality constrained programming, branch-and-cut

Category 1: Integer Programming

Category 2: Combinatorial Optimization

Category 3: Combinatorial Optimization (Branch and Cut Algorithms )

Citation: Georgia Tech report

Download: [PDF]

Entry Submitted: 10/08/2001
Entry Accepted: 10/08/2001
Entry Last Modified: 10/08/2001

Modify/Update this entry