| 解线性规划问题的梯度投影法 |
| |
| 引用本文： | 徐成贤,何尚录.解线性规划问题的梯度投影法[J].高校应用数学学报(A辑),1993(2):121-129. |
| |
| 作者姓名： | 徐成贤 何尚录 |
| |
| 作者单位： | 陕西省西安市西安交通大学数学系 710049
(徐成贤)，陕西省西安市西安交通大学数学系 710049(何尚录) |
| |
| 摘 要： | 本文叙述了一个求解线性规划问题的梯度投影法,导出了投影矩阵的递推公式,利用此公式可大大减少每次迭代所需的计算量。实例计算表明,本文给出的算法是一有效的算法,在某些方面它要优于Karmarkar算法和单纯形法。
|
| 关 键 词： | 线性规划 梯度投影法 单纯形法 |
GRADIENT PROJECTION METHOD FOR LINEAR PROGRAMMING |
| |
| Xu Chengxian He Shanglu.GRADIENT PROJECTION METHOD FOR LINEAR PROGRAMMING[J].Applied Mathematics A Journal of Chinese Universities,1993(2):121-129. |
| |
| Authors: | Xu Chengxian He Shanglu |
| |
| Institution: | Xian Jiaotong University |
| |
| Abstract: | This paper presents a new method for linear programming which uses the gradient projection method for nonlinear programming. A formula for updating the projected matrices on each iteration is derived. With this formula, computational effort is greatly reduced. Numerical results indicate that the new method is very practicable, and that it is superior to Karmarkar's algorithm and to the simplex method in some ways. |
| |
| Keywords: | Linear Programming Gradient Projection Method Simplex Method Global Convergence |
| 本文献已被 CNKI 维普 等数据库收录！ |
