In this paper, we put forward biconcave programming problem and generalized concaveprogramming problem more generally.
在本文中,我们提出了双凹规划问题和更一般的广义凹规划问题。
2
In this paper, a new branch and its bound algorithm for solving integer separable concaveprogramming problems is proposed, and the convergence of the algorithm is proved.
提出了一种新的解整数可分离凹规划问题的分支定界算法,并证明了其收敛性。
3
In this paper, a lower approximating algorithm of large-scale concave quadratic programming in unbounded domain is constructed.