| 一种直接收敛于鞍点的新的线性规划迭代算法 |
| |
| 引用本文： | 尚毅,张国光,卡世力,王晓峰,邵和平.一种直接收敛于鞍点的新的线性规划迭代算法[J].沈阳化工学院学报,1989(2). |
| |
| 作者姓名： | 尚毅 张国光 卡世力 王晓峰 邵和平 |
| |
| 作者单位： | 沈阳化工学院自动化系，沈阳化工学院自动化系，沈阳化工学院自动化系，沈阳化工学院自动化系，辽宁大学数学系 |
| |
| 摘 要： | 本文从拉格朗日方程出发推导出一种直接逼近鞍点的解线性规划问题的快速算法这种法特别适用于解决高维、低稀疏度的线性规划问题.计算机实验表明这种算法快于单纯形法.
|
| 关 键 词： | 鞍点 线性规划 最优控制 |
A New Iterative Algorithm for Linear programming Based on Direct Saddle Point Convergence |
| |
| Shang yi Zhang Guoguang Bian shili Wang Xiaofeng.A New Iterative Algorithm for Linear programming Based on Direct Saddle Point Convergence[J].Journal of Shenyang Institute of Chemical Technolgy,1989(2). |
| |
| Authors: | Shang yi Zhang Guoguang Bian shili Wang Xiaofeng |
| |
| Abstract: | This paper proposes a fast algorithm for linear programming which is based on direct approach to the saddle point of the Lagrangean.The algorithm appears particularly well suited for problems of high dimension and problems with great numbers of nonzero elements. Computational experience with the algorithm suggests that it converges much faster than the simplex method. |
| |
| Keywords: | saddle point search Linear programming optimal control |
| 本文献已被 CNKI 等数据库收录！ |
