Deriving Karmarkar’s LP algorithm using angular projection matrix
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.
Volume 129 | Issue 5
Click here for Editorial Note on CAP Mode