| 多项式约束优化问题的一种新方法 |
| |
| 引用本文： | 余览娒.多项式约束优化问题的一种新方法[J].温州大学学报(社会科学版),2009(3):22-26. |
| |
| 作者姓名： | 余览娒 |
| |
| 作者单位： | 温州大学数学与信息科学学院,浙江温州325035 |
| |
| 摘 要： | 针对带多项式不等式约束和多项式等式约束优化问题,提出了一个新的求全局最优解的方法：首先将其不等式约束转化为等式约束,然后按K-T条件将其化为解方程组问题,再利用软件包Wsolve求出方程组的解,从而获得原问题的全局最优解.实例计算表明,该方法在解这类优化问题时,是简明和行之有效的.
|
| 关 键 词： | 多项式约束优化 全局最优解 K-T点 软件包Wsolve |
New Method for Solving Polynomial Constraint Optimization Problem |
| |
| YU Lan.New Method for Solving Polynomial Constraint Optimization Problem[J].Journal of Wenzhou University Natural Science,2009(3):22-26. |
| |
| Authors: | YU Lan |
| |
| Institution: | YU Lanmei (School of Mathematics and Information Science, Wenzhou University, Wenzhou, China 325035) |
| |
| Abstract: | A global optimization solution for nonlinear programming problems with polynomial inequality and equality constraints is offered in the paper. Firstly, the programming with polynomial inequality constraints was transformed into a programming with polynomial equality constraints. Secondly, the solution of the polynomial constrained optimization problem was gained by using the K-T condition and the software Wsolve to solve the polynomial set. Practice shows that this method is simple but efficient in solving this kind of optimization problem. |
| |
| Keywords: | Polynomial Constrained Optimization Problem Global Optimal Solution K-T Point Software Wsolve |
| 本文献已被 维普 等数据库收录！ |
