Indian-born Narendra Karmarkar received his Ph.D in Computer Science in the United States. in 1984, he developed an algorithm that solved many linear-programming problems more efficiently than the simplex method.
