A new efficient branch and bound method is proposed for solving convex prog
rams with an additional monotonic nonconvex constraint. Computational exper
iments demonstrated that this method is quite practical for solving rank k
reverse convex programs with much higher values of k than previously consid
ered in the literature and can be applied to a wider class of nonconvex pro
blems.