Please tell me Life, Biography and Discoveries of Narendra Karmarkar
.
Please answer FAST.
.
Please tell me in about 1000 words...
Answers
Answered by
46
Hi,
=======:
Here is your answer,
===
Narendra Karmarkar
Narendra Krishna Karmarkar (born 1957) is an Indian mathematician, who developed Karmarkar's algorithm. He is listed as an ISI highly cited researcher.
Biography
Karmarkar received his B.Tech in Electrical Engineering from IIT Bombay in 1978, M.S. from the California Institute of Technology in 1979, and Ph.D. in Computer Science from the University of California, Berkeley in 1983 under the supervision of Richard M. Karp.
He invented the first provably polynomial time algorithm for linear programming also known as the interior point method. The algorithm is a cornerstone in the field of Linear Programming. He published his famous result in 1984 while he was working for Bell Laboratories in New Jersey. Karmarkar was a professor at the Tata Institute of Fundamental Researchin Mumbai from 1998 to 2005. He was briefly the scientific advisor to the chairman of the TATA group. He is currently working on a new architecture for supercomputing.
Karmarkar has received a number of awards:
Paris Kanellakis Award, 2000 given by The Association for Computing Machinery for "specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing".
Srinivasa Ramanujan Birth Centenary Award for 1999, presented by the Prime Minister of India.
Distinguished Alumnus Award, Indian Institute of Technology, Bombay, 1996
Distinguished Alumnus Award, Computer Science and Engineering, University of California, Berkeley (1993)
Fulkerson Prize in Discrete Mathematics given jointly by the American Mathematical Society & Mathematical Programming Society(1988)
Fellow of Bell Laboratories (1987– )
Texas Instruments Founders' Prize (1986)
Marconi International Young Scientist Award (1985)
American Academy of Achievement award, presented by former U.S. president (1985)
Frederick W. Lanchester Prize of the Operations Research Society of America for the Best Published Contributions to Operations Research (1984)
President of India gold medal, I.I.T. Bombay (1978)
Work
Karmarkar's algorithm
Karmarkar's algorithm solves linear programming problems in polynomial time. These problems are represented by "n" variables and "m" constraints. The previous method of solving these problems consisted of problem representation by an "x" sided solid with "y" vertices, where the solution was approached by traversing from vertex to vertex. Karmarkar's novel method approaches the solution by cutting through the above solid in its traversal. Consequently, complex optimization problems are solved much faster using the Karmarkar algorithm. A practical example of this efficiency is the solution to a complex problem in communications network optimization where the solution time was reduced from weeks to days. His algorithm thus enables faster business and policy decisions. Karmarkar's algorithm has stimulated the development of several interior point methods, some of which are used in current codes for solving linear programs.
Paris Kanellakis Award
The Association for Computing Machinery awarded him the prestigious Paris Kanellakis Award in 2000 for his work on polynomial time interior point methods for linear programming.
Galois geometry
After working on the Interior Point Method, Karmarkar worked on a new architecture for supercomputing, based on concepts from finite geometry, especially projective geometry over finite fields.
Current investigations
Currently, he is synthesizing these concepts with some new ideas he calls sculpturing free space (a non-linear analogue of what has popularly been described as folding the perfect corner).[9] This approach allows him to extend this work to the physical design of machines. He is now publishing updates on his recent work,[10] including an extended abstract.[11] This new paradigm was presented at IVNC, Polandon 16 July 2008,[12] and at MIT on 25 July 2008.[13] Some of his recent work is published at ieeexplore.[14] He delivered a lecture on his on going work at IIT Bombay in September 2013.[15] He gave a four-part series of lectures at FOCM 2014 (Foundations of Computational Mathematics)[16] titled "Towards a Broader View of Theory of Computing". First part of this lecture series is available at Cornell archive.
=======
HOPE you will UNDERSTAND MY WORDS,a request is here please as I am an Ambitious ranker I wish that to make my way easy for the VIRTUOSO rank you should mark my answer brainliest if you wish then only☺.
=======
=======:
Here is your answer,
===
Narendra Karmarkar
Narendra Krishna Karmarkar (born 1957) is an Indian mathematician, who developed Karmarkar's algorithm. He is listed as an ISI highly cited researcher.
Biography
Karmarkar received his B.Tech in Electrical Engineering from IIT Bombay in 1978, M.S. from the California Institute of Technology in 1979, and Ph.D. in Computer Science from the University of California, Berkeley in 1983 under the supervision of Richard M. Karp.
He invented the first provably polynomial time algorithm for linear programming also known as the interior point method. The algorithm is a cornerstone in the field of Linear Programming. He published his famous result in 1984 while he was working for Bell Laboratories in New Jersey. Karmarkar was a professor at the Tata Institute of Fundamental Researchin Mumbai from 1998 to 2005. He was briefly the scientific advisor to the chairman of the TATA group. He is currently working on a new architecture for supercomputing.
Karmarkar has received a number of awards:
Paris Kanellakis Award, 2000 given by The Association for Computing Machinery for "specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing".
Srinivasa Ramanujan Birth Centenary Award for 1999, presented by the Prime Minister of India.
Distinguished Alumnus Award, Indian Institute of Technology, Bombay, 1996
Distinguished Alumnus Award, Computer Science and Engineering, University of California, Berkeley (1993)
Fulkerson Prize in Discrete Mathematics given jointly by the American Mathematical Society & Mathematical Programming Society(1988)
Fellow of Bell Laboratories (1987– )
Texas Instruments Founders' Prize (1986)
Marconi International Young Scientist Award (1985)
American Academy of Achievement award, presented by former U.S. president (1985)
Frederick W. Lanchester Prize of the Operations Research Society of America for the Best Published Contributions to Operations Research (1984)
President of India gold medal, I.I.T. Bombay (1978)
Work
Karmarkar's algorithm
Karmarkar's algorithm solves linear programming problems in polynomial time. These problems are represented by "n" variables and "m" constraints. The previous method of solving these problems consisted of problem representation by an "x" sided solid with "y" vertices, where the solution was approached by traversing from vertex to vertex. Karmarkar's novel method approaches the solution by cutting through the above solid in its traversal. Consequently, complex optimization problems are solved much faster using the Karmarkar algorithm. A practical example of this efficiency is the solution to a complex problem in communications network optimization where the solution time was reduced from weeks to days. His algorithm thus enables faster business and policy decisions. Karmarkar's algorithm has stimulated the development of several interior point methods, some of which are used in current codes for solving linear programs.
Paris Kanellakis Award
The Association for Computing Machinery awarded him the prestigious Paris Kanellakis Award in 2000 for his work on polynomial time interior point methods for linear programming.
Galois geometry
After working on the Interior Point Method, Karmarkar worked on a new architecture for supercomputing, based on concepts from finite geometry, especially projective geometry over finite fields.
Current investigations
Currently, he is synthesizing these concepts with some new ideas he calls sculpturing free space (a non-linear analogue of what has popularly been described as folding the perfect corner).[9] This approach allows him to extend this work to the physical design of machines. He is now publishing updates on his recent work,[10] including an extended abstract.[11] This new paradigm was presented at IVNC, Polandon 16 July 2008,[12] and at MIT on 25 July 2008.[13] Some of his recent work is published at ieeexplore.[14] He delivered a lecture on his on going work at IIT Bombay in September 2013.[15] He gave a four-part series of lectures at FOCM 2014 (Foundations of Computational Mathematics)[16] titled "Towards a Broader View of Theory of Computing". First part of this lecture series is available at Cornell archive.
=======
HOPE you will UNDERSTAND MY WORDS,a request is here please as I am an Ambitious ranker I wish that to make my way easy for the VIRTUOSO rank you should mark my answer brainliest if you wish then only☺.
=======
Heena66:
You know very well that When someone will answer the question then only I will be able to mark you as BRAINLIEST
if someone will answer the question.... then I will compare your both answer and then whose answer I will consider better ...I will mark that as BRAINLIEST
ohkay
you came before me...you should know all this...u r ambitious but I am still a helping hand
no..u haven't disturbed me
No..need of sorry
Answered by
0
Answer:
- please mark as brainlist
Step-by-step explanation:
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
Similar questions