Sequential Unconstrained Minimization Techniques (SUMT) are most common and comparatively successful method in constrained optimization.
罚函数法(SUMT)是处理约束优化问题时最常用、也是较为成功的一种方法。
A novel algorithm is proposed to deal with both unconstrained and constrained numerical optimization problems.
针对数值优化问题，提出了组织进化数值优化算法。
Punishment function is used to transfer the constrained optimization to unconstrained optimization and the Nelder and Mead Method is used to solve this optimization problem.
采用罚函数将约束优化转化为无约束优化，并用单纯形方法求解。
应用推荐