| 一类特殊多项式整数规划问题的最优化算法 |
| |
| 引用本文： | 田静,吴至友,J.Ugon.一类特殊多项式整数规划问题的最优化算法[J].运筹学学报,2011,15(4):23-35. |
| |
| 作者姓名： | 田静 吴至友 J.Ugon |
| |
| 作者单位： | 1. ;
2. University of Ballarat, Australia;
3. 重庆师范大学数学学院 |
| |
| 基金项目： | supported by National Natural Science Foundation of China 10971241,by SRF for ROCS,SEM; by Australia Research Council Project Grant |
| |
| 摘 要： | 本文考虑了一类特殊的多项式整数规划问题。此类问题有很广泛的实际应用，并且是NP难问题。对于这类问题，最优性必要条件和最优性充分条件已经给出。我们在本文中将要利用这些最优性条件设计最优化算法。首 先，利用最优性必要条件，我们给出了一种新的局部优化算法。进而我们结合最优性充分条件、新的局部优化算法和辅助函数，设计了新的全局最优化算法。本文给出的算例展示出我们的算法是有效的和可靠的。
|
| 关 键 词： | 多项式整数规划 局部最优化算法 全局最优化算法 |
| 收稿时间： | 2011-01-26 |
| 修稿时间： | 2011-11-02 |
Optimization Methods for a Class of Integer Polynomial Programming Problems |
| |
| TIAN Jing WU Zhiyou UGON Julien .School of Science,Information Technology , Engineering,University of Ballarat,VIC ,Australia,.School of Mathematical Science,Chongqing Normal University,Chongqing ,China.Optimization Methods for a Class of Integer Polynomial Programming Problems[J].OR Transactions,2011,15(4):23-35. |
| |
| Authors: | TIAN Jing WU Zhiyou UGON Julien School of Science Information Technology Engineering University of Ballarat VIC Australia School of Mathematical Science Chongqing Normal University Chongqing China |
| |
| Institution: | TIAN Jing WU Zhiyou UGON Julien 1.School of Science,Information Technology and Engineering,University of Ballarat,VIC 3353,Australia,2.School of Mathematical Science,Chongqing Normal University,Chongqing 400047,China |
| |
| Abstract: | In this paper,a class of integer polynomial programming problems is considered.This class of integer polynomial programming problems has a wide range of practical applications and is NP hard.For these problems,necessary global optimality conditions and sufficient global optimality conditions have been presented recently. We will design some optimization methods to this class of integer polynomial programming problems by using these global optimality conditions.Firstly,a local optimization method is designed... |
| |
| Keywords: | polynomial integer programming problem local optimization method global optimization method |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《运筹学学报》浏览原始摘要信息 |
| 点击此处可从《运筹学学报》下载免费的PDF全文 |
|
