共查询到1条相似文献,搜索用时 0 毫秒
1.
Nguyen Van Thoai 《Journal of Global Optimization》2002,22(1-4):263-270
We discuss the convergence of a decomposition branch-and-bound algorithm using Lagrangian duality for partly convex programs in the general form. It is shown that this decomposition algorithm has all convergence properties as any known branch-and-bound algorithm in global optimization under usual assumptions. Thus, some strict assumptions discussed in the literature are avoidable. 相似文献