| 求非线性规划全局最优解的一个算法 |
| |
| 引用本文： | 孙多青,王日爽.求非线性规划全局最优解的一个算法[J].甘肃联合大学学报(自然科学版),1998(2). |
| |
| 作者姓名： | 孙多青 王日爽 |
| |
| 作者单位： | 北京航空航天大学应用数学系!北京，100083 |
| |
| 摘 要： | 首先给出了判别f（x）的极小值点x0∈D是否为f（x）的最优解的充分必要条件（D为Rn中的闭区域）；在此基础上，给出了求一元函数及多元函数全局最优解的方法．此外，还给出了求一元函数极值的一个迭代算法．
|
| 关 键 词： | 非线性规划 算法 解 |
A Algorithm for Solving the Global Optimal Solutions of Nonlinear Programming |
| |
| Sun Duoqing, Wang Rishuang.A Algorithm for Solving the Global Optimal Solutions of Nonlinear Programming[J].Journal of Gansu Lianhe University :Natural Sciences,1998(2). |
| |
| Authors: | Sun Duoqing Wang Rishuang |
| |
| Abstract: | A necessary and sufficient condition is presented first to decide whether a minimal point x0 of f(x) is a global optimal solution of (x), where D is a closed region in Rn. On the basis of this, an algorithm is given to solve the global optimal solution of (x). In addition, an iterative computing is offered for solving minimal points of singlevariate function. |
| |
| Keywords: | nonlinear programming algorithm solution |
| 本文献已被 CNKI 等数据库收录！ |
