V Ch Venkaiah
Articles written in Proceedings – Mathematical Sciences
Volume 100 Issue 3 December 1990 pp 295-301
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.
Volume 102 Issue 2 August 1992 pp 147-153
A new cryptosystem that uses modulo arithmetic operations is proposed. It is based on Rivest-Shamir-Adleman’s public key cryptosystem. A feature of the proposed system is that the encryption and decryption procedures are computationally less intensive, and hence the system is amenable for high data bit rate communications.
Volume 106 Issue 1 February 1996 pp 69-77
Understanding Karmarkar’s algorithm is both desirable and necessary for its efficient implementation, for further improvement and for carrying out complexity analysis. In this report an algorithm based on the concept of angular projection matrix, to solve linear programming problems is derived. Surprisingly, this algorithm coincides with the affine version of Karmarkar’s algorithm.