A direct heuristic algorithm for linear programming
| 详细信息 | 推荐本文 | |
- 作者：S. K. Sen (1)
A. Ramful (12) - 关键词：Direct heuristic algorithm for linear programming ; interior ; point methods ; optimality test ; p ; inverse ; revised simplex algorithm
- 刊名：Proceedings Mathematical Sciences
- 出版时间：February 2000
- 出版年：2000
- 期刊代码：157_0973-7685
- 类别：mat
- 卷：110
- 期：1
- 页码：79-101
- 数据来源：sp
摘要
AnO(n 3) mathematically non-iterative heuristic procedure that needs no artificial variable is presented for solving linear programming problems. An optimality test is included. Numerical experiments depict the utility/scope of such a procedure.