Narendra Karmarkar

E568397

Narendra Karmarkar is an Indian mathematician and computer scientist best known for developing Karmarkar's algorithm, a groundbreaking polynomial-time method for linear programming.

Try in SPARQL Jump to: Statements Referenced by

Statements (42)

Predicate Object
instanceOf Indian computer scientist
Indian mathematician
mathematician
person
algorithmComplexity polynomial time
almaMater Caltech NERFINISHED
IIT Bombay NERFINISHED
award Fulkerson Prize NERFINISHED
US National Academy of Engineering membership NERFINISHED
citizenship India
contribution developed a polynomial-time algorithm for linear programming
introduced a new class of interior-point methods
countryOfBirth India NERFINISHED
degree PhD in computer science
developedIn 1980s
education California Institute of Technology NERFINISHED
Indian Institute of Technology Bombay NERFINISHED
employer AT&T Bell Laboratories NERFINISHED
era 20th-century mathematics
21st-century mathematics
field computer science
mathematics
operations research
optimization
impact significantly improved practical performance of linear programming solvers
influencedBy linear programming theory prior to interior-point methods
influencedField combinatorial optimization
linear programming
theory of algorithms
knownFor Karmarkar's algorithm NERFINISHED
interior-point methods for linear programming
membership National Academy of Engineering (United States) NERFINISHED
nationality Indian
notableConcept projective scaling transformation in linear programming
notableWork Karmarkar's algorithm for linear programming NERFINISHED
occupation computer scientist
mathematician
publicationTopic interior-point methods
linear programming algorithms
researchArea algorithms
complexity theory
numerical optimization

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Banaras Hindu University hasNotableAlumni Narendra Karmarkar