WI
WillKirkmanM/karmarkar
Karmarkar’s Algorithm is a Polynomial-Time Interior-Point Method for Linear Programming that Efficiently Solves Large-Scale Problems by Iteratively Moving Toward Optimality Inside the Feasible Region with Complexity Roughly O(m^1.5n^2L), Significantly Improving on Prior Methods and Benefiting from Parallel Processing
Karmarkar
Karmarkar's Algorithm is a Polynomial-Time Interior-Point Method for Linear Programming that Efficiently Solves Large-Scale Problems by Iteratively Moving Toward Optimality Inside the Feasible Region with Complexity Roughly O(m^1.5n^2L), Significantly Improving on Prior Methods and Benefiting from Parallel Processing