摘要
本文提出了一种求解带约束非线性规划问题的一般方法。与现有的方法相比 ,它不受可导性 ,单峰性和是否病态等因素的限制 ,适用范围广。
A general method is proposed for solving ordinary constrained nonlinear programming problem by SUMT and GA, in contrast to the existing algorithms, it is bound to no factor whether objective function to be differentiable,single peak and ill typed or not, and almost geared to all constrained nonliner programming problems. An example shows that this algorithm is efficient.
出处
《内江师范学院学报》
2002年第2期3-6,共4页
Journal of Neijiang Normal University
关键词
序列无约束极小化技术
遗传算法
带约束非线性规划
应用
优化
SUMT(Sequential Unconstrained Minimization Techques)
GA(Genetic Algorithm)
constrained nonlinear programming problem
