论文部分内容阅读
HJSUMT程序用于优化有约束的最小化问题,将模式搜索与SUMT法结合使用,一旦搜索出了可行域,采用探试程序技巧返回。 HJSUMT程序算法上三个主要概念: 搜索方法——取自Hooke和Jeeves SUMT公式——取自Fiacco和McCormick 返回技术——取自Paviani和Himmelblau 文中给出了三个实例。
The HJSUMT program is used to optimize constrained minimization problems. The pattern search is used in conjunction with the SUMT method. Once a feasible region has been found, it is returned using the probing procedure. The HJSUMT program algorithm has three main concepts: Search Methods - From the Hooke and Jeeves SUMT Formulas - From Fiacco and McCormick Return Techniques - From the Paviani and Himmelblau texts gives three examples.