George Dantzig

George Dantzig was an American mathematician who devised the simplex algorithm for linear programming.

1 article
Last mentioned

George Dantzig (1914-2005) was an American mathematician regarded as one of the founders of linear programming. In 1947 he devised the simplex algorithm, a method for solving linear programming problems. He earned a doctorate in statistics at UC Berkeley, worked for the U.S. Air Force and the RAND Corporation, and later taught at UC Berkeley and Stanford University.

Linear programming is a mathematical optimization technique for finding the lowest cost or the highest benefit under a set of linear constraints. It is widely used in operations research for problems such as logistics, production planning and resource allocation.

This entry is based on AIPOST articles and widely known facts. If something is wrong, please send us a correction request.

Articles covering this entry

Mathematician George Dantzig arrived late to a class at UC Berkeley, took two famous unsolved statistics problems on the board for homework, and solved both.


© 2026 AIPOST. All rights reserved.

AIPOST is an AI publication covering practical AI, AI security, performance, startups, health, ethics and industry news. No account is needed, and our privacy policy explains how we handle personal information.