Search results
Narendra Krishna Karmarkar (born circa 1956) is an Indian mathematician. Karmarkar developed Karmarkar's algorithm. He is listed as an ISI highly cited researcher. He invented one of the first provably polynomial time algorithms for linear programming, which is generally referred to as an interior point method. The algorithm is a cornerstone in ...
Jan 19, 2024 · In the realm of mathematics, where intricacies often challenge the brightest minds, Narendra Krishna Karmarkar stands as a beacon of innovation and brilliance. Born around 1956 in Gwalior, India, Karmarkar’s journey in the world of mathematics has been nothing short of extraordinary.
Narendra KARMARKAR | Cited by 6,854 | | Read 40 publications | Contact Narendra KARMARKAR
Karmarkar's algorithm is an algorithm introduced by Narendra Karmarkar in 1984 for solving linear programming problems. It was the first reasonably efficient algorithm that solves these problems in polynomial time. The ellipsoid method is also polynomial time but proved to be inefficient in practice.
Semantic Scholar profile for N. Karmarkar, with 473 highly influential citations and 38 scientific research papers.
Narendra Karmarkar is being recognized for his theoretical work in devising an Interior Point method for linear programming that provably runs in polynomial time, and for his implementation work suggesting that Interior Point methods could be effective for linear programming in practice as well as theory.
People also ask
Who is Narendra Karmarkar?
What is Karmarkar's algorithm?
Can a 'Karmarkar algorithm' solve complex linear programming problems?
How did Karmarkar solve linear programs in polynomial time?
Narendra Karmarkar, S. A. Thakur: An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems. IPCO 1992: 406-420.
