A note on the convergence of an algorithm for nonconvex programming problems

A strong convergence theorem is proven to hold for the general algorithm of the branch and bound type for solving nonconvex programming problems given in [1].