• V Ch Venkaiah

      Articles written in Proceedings – Mathematical Sciences

    • An efficient algorithm for linear programming

      V Ch Venkaiah

      More Details Abstract Fulltext PDF

      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.

    • An RSA based public-key cryptosystem for secure communication

      V Ch Venkaiah

      More Details Abstract Fulltext PDF

      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.

    • Deriving Karmarkar’s LP algorithm using angular projection matrix

      V Ch Venkaiah

      More Details Abstract Fulltext PDF

      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.

  • Proceedings – Mathematical Sciences | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2017-2019 Indian Academy of Sciences, Bengaluru.