A direct heuristic algorithm for linear programming

被引：0
作者：
S. K. Sen
A. Ramful
机构：
[1] Indian Institute of Science,Supercomputer Education and Research Centre
[2] University of Mauritius,Department of Mathematics
来源：
Proceedings Mathematical Sciences | 2000年 / 110卷
关键词：
Direct heuristic algorithm for linear programming; interior-point methods; optimality test; -inverse; revised simplex algorithm;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
AnO(n3) 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.
引用
收藏
页码：79 / 101
页数：22
相关论文
共 48 条
[1]  
Barnes E R(1986)A variation of Karmarkar’s algorithm for solving linear programming problems Math. Prog. 36 174-182
[2]  
Beale E M L(1955)Cycling in the dual simplex algorithm Naval Research Logistics Quarterly 2 269-275
[3]  
Campbell S L(1977)On the continuity of the Moore-Penrose and Drazkin generalized inverses Linear algebra and its applications 18 53-57
[4]  
Dongarra J J(1988)An extended set of Fortran basis linear algebra subprograms ACM Trans. Math. Software 14 1-17
[5]  
De Croz J J(1965)Calculating the singular values and the pseudoinverse of a matrix SIAM J. Numer. Anal. B-2 205-224
[6]  
Hammerling S J(1959)The pseudoinverse of a rectangular or singular matrix and its application to the solution of systems of linear equations SIAM Rev. 1 38-43
[7]  
Hanson R J(1986)Karmarkar’s Linear Programming Algorithm Interfaces 16 75-90
[8]  
Golub G(1979)A polynomial algorithm in linear programming Doklady Akad. Nauk SSSR S244 1093-1096
[9]  
Kahan W(1993)An inequality sorting algorithm for a class of linear programming problems J. Math. Anal. Appl. 174 450-460
[10]  
Greville T N E(1996)Vectors versus matrices: p-inversion, cryptographic application, and vector implementation Neural, Parallel, and Scientific Computations 4 129-140
12345