In This paper, we propose a new branch and bound algorithm for the solution of large scalc sepmable concave programming problems. The largest distance biseetiou (LDB) technique is proposed to divide rectangle into sub-rectangles when one problem is branched into two subproblems. It is proved theft the LDB method in a normal rectangle subdivision (NRS). Numerical tests on problems with dimensions from 100 to 10000 show that the propped branch and bound algorithm is efficient for solving large scale separable concave programming problems, and convergence rate is faster than w-subdivision method.