Narendra Karmarkar

Indian mathematician

Written by

The Information Architects of Encyclopaedia Britannica

Last updated

July 21, 2026

Quick Summary

Narendra Karmarkar is an Indian mathematician known for developing an interior point method algorithm in 1984. This algorithm proved competitive with the simplex method for solving linear programming problems. Linear programming is a mathematical technique used to maximize or minimize a linear function subject to various constraints.1

This method is valuable in business planning and industrial engineering for making quantitative decisions. It involves finding the optimal value of an objective function, such as maximizing profit, while adhering to limitations like resource availability or production capacities, which are expressed as linear inequalities. Karmarkar's contribution was significant because his polynomial-time algorithm allowed for the solution of complex problems that were previously computationally inaccessible.12

Summary created from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles.

3 Britannica Sources

Ask Britannica AI about this topic

Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.

linear programming
In 1984 Indian mathematician Narendra Karmarkar discovered another polynomial-time algorithm, the interior point method, that proved competitive with the simplex method.
Read More
In 1984 Indian mathematician Narendra Karmarkar discovered another polynomial-time algorithm, the interior point method, that proved competitive with the simplex method.
Read More