In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.

With the aim at deriving optimal solutions, branch-and-bound method is one of the most well adopted implicit enumerative approaches.

Based on the general principle of the branch-and-bound method, the branching rule and the bounding calculating method to solve this problem are proposed.