The D-C (difference of convex functions) programming occurs very often in economic and financial field. In this paper, a class of D-C programming problems be studied, witch objection function is the sum of a convex quadratic function and a separable concave function, the constrains is the intersection of a polytop and a rectangular. A branch and bound algorithm is given for solving it. we compare the largest distance bisection with x-subdivision in branch and bound algorithm. Numerical tests on different dimensions showed that the proposed branch and bound algorithm is efficient for solving medium-scale problems, and the efficiency of the largest distance bisection and x-subdivision is nearly.