双凹函数的极小问题

Method for minimizing a biconcave function

本文针对有界多面凸集上，双凹函数极小问题，提出一个分枝定界方法。该方法采用松驰约束方法确定界，利用单纯形半分进行分枝。

We propose a branch-and- bound method for solving biconcave function. The bounding operation is based on a certain relaxation of the constrains. The branching is simplex bisection.