| 一类线性规划问题的强多项式算法 |
| |
| 引用本文： | 吉训仁. 一类线性规划问题的强多项式算法[J]. 中山大学学报(自然科学版), 1997, 0(1) |
| |
| 作者姓名： | 吉训仁 |
| |
| 作者单位： | 中山大学管理学院 |
| |
| 摘 要： | 对一类线性规划问题提出了一个强多项式算法．此算法可进行双向搜索．可行解集、目标函数的两个目标值以及相应的最优解，全部可行基与最优基可以一步求得，无需迭代．算法的复杂性为Ｏ（ｎ３＋ｎ２＋ｎ），其中ｎ为线性规划问题变量的个数
|
| 关 键 词： | 线性方程组，线性不等式，线性规划，多项式算法，强多项式算法 |
A STRONGLY POLYNOMIAL ALGORITHM FOR A CLASS OF LINEAR PROGRAMMING PROBLEMS |
| |
| Ji Xunren. A STRONGLY POLYNOMIAL ALGORITHM FOR A CLASS OF LINEAR PROGRAMMING PROBLEMS[J]. Acta Scientiarum Naturalium Universitatis Sunyatseni, 1997, 0(1) |
| |
| Authors: | Ji Xunren |
| |
| Abstract: | This paper presents a strongly polynomial algorithm for a class of linear programming problems. With this algorithm, the bi directional search can be implemented. The set of feasible solutions, two target values and the corresponding optimal solutions of the objective function, all the feasible bases and the optimal bases can be obtained with no iterations. The complexity of the algorithm is O(n 3 n 2 n) , where n is the number of variables. |
| |
| Keywords: | simultaneous linear equations linear inequality linear programming polynomial algorithm strongly polynomial algorithm |
| 本文献已被 CNKI 等数据库收录！ |
