|
|||||
|
|
| 在Newton-PCG方法中的一个一维整数最优化问题 | |
| 引用本文： | 张春华,张海滨,钟萍.在Newton-PCG方法中的一个一维整数最优化问题[J].运筹学学报,2003,7(3):38-44. |
| 作者姓名： | 张春华 张海滨 钟萍 |
| 作者单位： | 1. 中国农业大学经济管理学院,北京,100083 2. 北京工业大学应用数理学院,北京,100022 3. 中国农业大学理学院,北京,100083 |
| 摘 要： | 本文研究在Newton-PCG方法中出现的一个一维整数最优化问题．通过引入和研究几个连续变量的辅助问题，我们建立了一个简单而有效的算法．这一算法的主要计算量是求解两次非线形方程zlnz—c=0，因此是非常小的．另外，我们还对这一问题的最优值进行了估计． |
| 关 键 词： | Newton-PCG方法 一维整数最优化 非线性方程 全局解 最优值估计 连续变量 |
An Integer One-Dimensional Optimization Problem in Newton-PCG Method |
|
| CHUNHUN ZHANG HANBIN ZHANG PING ZHONG College of Economic Management,China Agriculture University.An Integer One-Dimensional Optimization Problem in Newton-PCG Method[J].OR Transactions,2003,7(3):38-44. | |
| Authors: | CHUNHUN ZHANG HANBIN ZHANG PING ZHONG College of Economic Management China Agriculture University |
| Abstract: | Consider an integer one-dimensional optimization problem appeared in Newton-PCG method. By introducing and observing some auxiliary problems with continuous variables, a simple and efficient algorithm is established. Its computation cost is very small; its main cost is only to find the solution to the equation z In z-c= 0 twice. In addition, the optimal value of this problem is estimated. |
| Keywords: | OR one-dimensional optimization problem integer variable continuous variable |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |