An efficient algorithm for linear programming
From MaRDI portal
Publication:2639770
zbMATH Open0718.90059MaRDI QIDQ2639770FDOQ2639770
Authors: V. Ch. Venkaiah
Publication date: 1990
Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)
Recommendations
Moore-Penrose inverseprojection matrixprojective transformationorthogonal projectionKarmarkar's algorithmdirection vector
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)
Cited In (8)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- Deriving Karmarkar's LP algorithm using angular projection matrix
- An algorithm for linear programming that is easy to implement
- Title not available (Why is that?)
- Efficient parallel linear programming
- A note to the paper An efficient algorithm for linear programming of V. Ch. Venkaiah
This page was built for publication: An efficient algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2639770)