Minimizing the sum of a convex function and the product of two affine functions over a convex set

An efficient branch-and-bound algorithm for minimizing the sum of a convex function and the product of two affine functions over a convex set is proposed. The branching takes place in an interval of R the bounding is a relaxation