An efficient algorithm for linear programming

Venkaiah, CH V (1990) An efficient algorithm for linear programming. In: Proceedings of the Indian Academy of Sciences - Mathematical Sciences, 100 (3). pp. 295-301.

Preview

PDF Linear.pdf - Published Version Download (203kB)

Abstract

A simple but efficient algorithm is presented for linear programming. The algorithm computes the projection matrix exactly once throughout the computation unlike that of Karmarkar’s algorithm where in the projection matrix is computed at each and every iteration. The algorithm is best suitable to be implemented on a parallel architecture. Complexity of the algorithm is being studied.

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:	Direction vector - Karmarkar’s algorithm - Moore-Penrose inverse - orthogonal projection - projection matrix - projective transformation
Department/Centre:	Division of Physical & Mathematical Sciences > Mathematics
Date Deposited:	07 Jan 2011 08:57
Last Modified:	07 Jan 2011 08:57
URI:	http://eprints.iisc.ac.in/id/eprint/34878

Actions (login required)

View Item