• A direct heuristic algorithm for linear programming

    • Fulltext


        Click here to view fulltext PDF

      Permanent link:

    • Keywords


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

    • Abstract


      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.

    • Author Affiliations


      S K Sen1 A Ramful1 2

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

  • Proceedings – Mathematical Sciences | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2022-2023 Indian Academy of Sciences, Bengaluru.