In this paper, we put forward biconcave programming problem and generalized concave programming problem more generally.

In this paper, a new branch and its bound algorithm for solving integer separable concave programming problems is proposed, and the convergence of the algorithm is proved.

In this paper, a lower approximating algorithm of large-scale concave quadratic programming in unbounded domain is constructed.