A BRANCH AND BOUND ALGORITHM FOR SEPARABLE CONCAVE PROGRAMMING

• 来源期刊: 计算数学(英文版)
• 关键词: Branch and bound algorithm Separable programming Largest distance bisec-tion Normal rectangle subdivision ω-subdivision.
• 年，卷（期）: 2004,（6）
• 页码范围: 895-904
• 页数: 10页
• 语种: 英文

摘要

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