摘要
在无约束非线性规划问题全局优化的模拟退火算法基础上，进行有约束问题求解的进一步探讨，对不等式约束条件提出了检验法和罚函数法的处理方法，对等式约束条件开发了罚函数法和解方程法的求解步骤，并进行了分析比较，从而形成了完整的求取非线性规划问题全局优化的模拟退火算法。通过对文献例题的计算。
On the basis of simulated annealing(SA) algorithm for nonconstraint nonlinear programming(NLP) problems, an improvement and further approach to global optimization of SA on nonconvex NLP with constraints is introduced. To inequality constraints, a check procedure and a penalty function procedure are proposed, and equality constraints are dealt with by a procedure of solving equations in which tear equations may be converged by an iterating way or a penalty function way. As a result, an SA algorithm for global optimization on nonconvex NLP problems with constraints is developed. Results of examples show that the proposed approach is better than existing methods.
出处
《清华大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
1997年第6期5-9,共5页
Journal of Tsinghua University(Science and Technology)
基金
国家教委留学回国人员科研资助
关键词
全局优化
不等式约束
非线性规划
模拟退火法
global optimization
simulated annealing
equality constraint
inequality constraint
penalty function
