|
convex programming
|
|
【计】 凸规划
|
分类:
|
详细解释:
|
|
以下为句子列表:
英文: Finally, prove that any global optimal solution of the converted concave minimization problem or reverse convex programming problem obtained by the existing algorithms is an approximate global optimal solution of the original problem.
中文: 最后,还证明了得到的凹规划和反凸规划的全局最优解就是原问题的近似全局最优解。
更详细...
英文: The mathematical programming methods, both the method of moving asymptotes (MMA) belonging to convex programming methods and the sequential linear programming method (SLP), were used to solving optimization problems.
中文: 用移动渐进线方法(MMA)求解单目标优化问题,用序列线性规划方法(SLP)求解模糊-目标混合规划问题。
更详细...
英文: We solved multiobject nonconvex programming by means of homotopy-interior method and got the minimum weak effect solution under quasi-normal cone condition; meanwhile we proved the convergence of this method.
中文: 摘要利用同伦内点算法求解多目标非凸规划在拟锥条件下的最小弱有效解,并证明了算法的大范围收敛性。
更详细...
|
|
|
|