Based on dual relaxation method to extend a special convex separable programming algorithm, this tracking algorithm was constructed by parametric analysis.
该参数优化算法可在对偶松弛凸可分规划算法的主循环之外，通过少量参数化扩展得到。
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 new branch and its bound algorithm for solving integer separable concave programming problems is proposed, and the convergence of the algorithm is proved.
提出了一种新的解整数可分离凹规划问题的分支定界算法，并证明了其收敛性。
应用推荐