| 求解线性规划的几种方法 |
| |
| 引用本文： | 雍龙泉.求解线性规划的几种方法[J].江西科学,2007,25(2):202-205,212. |
| |
| 作者姓名： | 雍龙泉 |
| |
| 作者单位： | 陕西理工学院数学系,陕西,汉中,723001 |
| |
| 基金项目： | 陕西理工学院校科研和教改项目 |
| |
| 摘 要： | 线性规划是运筹学中应用最广泛的一个分支,详细地分析了线性规划的非多项式算法和多项式算法;给出了求解线性规划问题常用的数学软件,并对这些软件做了介绍。最后给出了线性规划问题的原-对偶内点算法,数值实验表明该算法具有很好的收敛性与稳定性。
|
| 关 键 词： | 线性规划 多项式算法 数学软件 原-对偶内点算法 |
| 文章编号： | 1001-3679（2007）02-0202-05 |
| 修稿时间： | 2007-01-042007-02-26 |
Some Methods for Solving Linear Programming |
| |
| YONG Long-quan.Some Methods for Solving Linear Programming[J].Jiangxi Science,2007,25(2):202-205,212. |
| |
| Authors: | YONG Long-quan |
| |
| Institution: | Department of Mathematics, Shanxi University of Technology, Shanxi Hanzhong 723001 PRC |
| |
| Abstract: | Linear programming is widely applied in all branches of Operation Research.In this paper,the non-polynomial-time algorithm and polynomial-time algorithm is analyzed in detail,meanwhile,mathematical software for solving linear programming is presented and introduced.Finally,we give numerical examples about the primal-dual interior point algorithm for linear programming,the numerical experiment results demonstrate that the algorithm has perfect convergence and stability. |
| |
| Keywords: | Linear programming Polynomial-time algorithm Mathematical software Primal-dual interior point algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
