A direct heuristic algorithm for linear programming

Sen, SK and Ramful, A (2000) A direct heuristic algorithm for linear programming. In: Proceedings of the Indian Academy of Sciences Mathematical Sciences, 110 (1). pp. 79-101.

Preview

PDF 42adirect110(1)-25feb2000.pdf Download (169kB)

Abstract

An $O(n^{\mathrn{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.

Item Type:	Journal Article
Publication:	Proceedings of the Indian Academy of Sciences Mathematical Sciences
Publisher:	Indian Academy of Sciences
Additional Information:	Copyright of this article belongs to Indian Academy of Sciences.
Keywords:	Direct heuristic algorithm for linear programming;interior-point methods;optimality test;p-inverse;revised simplex algorithm.
Department/Centre:	Division of Interdisciplinary Sciences > Supercomputer Education & Research Centre
Date Deposited:	17 Sep 2004
Last Modified:	19 Sep 2010 04:16
URI:	http://eprints.iisc.ac.in/id/eprint/1823

Actions (login required)

View Item