How did John von Neumann contribute to the mathematical foundations of linear programming?

John von Neumann is widely credited with laying much of the mathematical foundation for linear programming through his pioneering work in game theory and economic modeling.1

His contributions include:

• Conjecture of Equivalence: In 1947, von Neumann conjectured that linear programming problems and matrix games are mathematically equivalent.1
• Duality: He introduced the critical concept of duality, which became a cornerstone for the theoretical development of the field.1
• Economic Analysis: As early as 1937, he analyzed a steadily expanding economy using fixed technological coefficients, providing an early framework for what would become linear programming applications.1
• Numerical Solutions: He proposed several methods for the numerical solution of both linear programming and game-theoretic problems.1
• Foundational Theory: His 1928 proof of the minimax theorem and his 1944 collaboration with Oskar Morgenstern on Theory of Games and Economic Behaviour provided the rigorous mathematical environment necessary for the subsequent formalization of linear programming.123

While George Dantzig is recognized for devising the simplex method in 1947, von Neumann’s theoretical insights were instrumental in establishing the field's mathematical underpinnings.14