To the nonconvex programming, the article makes it local convexification by introducing a simple penalty function into the objective function, and solves it like solving convex programming.
针对非凸规划，本文引进一简单的惩罚函数将其局部凸化，然后用凸规划的方法求解。
This article presents a branch and bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region.
本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。
应用推荐