Leonid Kantorovich

Leonid Kantorovich is the mathematician who discovered that resource allocation is, at bottom, a mathematical problem with a precise and computable solution. Assigned in 1939 by a Leningrad plywood trust to improve the use of their machines, he invented what we now call linear programming—the technique of maximizing a linear objective subject to linear constraints—and discovered, in doing so, that every feasible allocation generates implicit prices (which he called objectively determined valuations) that measure the marginal cost of each constraint. These shadow prices are not set by anyone; they emerge from the structure of the problem itself. For this work, delayed and suppressed in the Soviet Union because it implied that central planners were systematically misallocating resources, he shared the 1975 Nobel Memorial Prize in Economic Sciences with Tjalling Koopmans. His insight runs through contemporary AI in a way its practitioners often do not recognize: every large-scale optimization