Click here to view fulltext PDF

Permanent link:
https://www.ias.ac.in/article/fulltext/pmsc/110/01/0079-0101

Direct heuristic algorithm for linear programming; interior-point methods; optimality test; p-inverse; revised simplex algorithm

AnO(n³) 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.

S K Sen¹ A Ramful^{1 2}

1. Supercomputer Education and Research Centre, Indian Institute of Science, Bangalore - 560012, India
2. Department of Mathematics, University of Mauritius, Reduit, Mauritius

Published

February 2000

Manuscript received

13 August 1998