在本文中，我们提出了双凹规划问题和更一般的广义凹规划问题。

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

youdao

在本文中 ，我们提出了双凹规划问题和更一般的广义凹规划问题 。

This thesis presents the combination of the stochastic programming and generalized goal programming.

youdao

提出了一种新的解整数可分离凹规划问题的分支定界算法，并证明了其收敛性。

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.

youdao