An efficient method for obtaining sharp bounds for nonlinear Boolean programming problems

It is well-known that the integrality condition for variables in Boolean programming problems can be formulated by quadratic equality constraints. The Lagrangean dual to the nonlinear programming problem thus obtained is examined. The paper states an efficient method for obtaining sharp bounds for the branch and bound process in solving the integer problem. The obtained results are discussed on a Boolean quadratic optimization problem. Numerical results are presented.