• Citer

The zero-one knapsack problem with equality constraint

par Kaufman, Leonard;Plastria, Frank ;Tubeeckx, S.
Référence European journal of operational research, 19, 3, page (384-389)
Publication Publié, 1985-03

Article révisé par les pairs

• Détails
• Contenu

Résumé :

The zero-one knapsack problem is a linear zero-one programming problem with a single inequality constraint. This problem has been extensively studied and many applications and efficient algorithms have been published. In this paper we consider a similar problem, one with an equality instead of the inequality constraint. By replacing the equality by two inequalities one of which is placed in the economic function, a Lagrangean relaxation of the problem is obtained. The relation between the relaxed problem and the original problem is examined and it is shown how the optimal value of the relaxed problem varies with increasing values of the Lagrangean multiplier. Using these results an algorithm for solving the problem is proposed. The paper concludes with a discussion of computational experience. © 1985.