1975 Nobel Memorial Prize in Economic Sciences
Reason for Award
for their contributions to the theory of optimum allocation of resources
Laureates
Soviet Union
Netherlands
Explanation
When we share a school lunch pizza, we think about how to divide it fairly without wasting any piece. Mr. Kantorovich and Mr. Koopmans used mathematics to find a similar fair-sharing rule for factories and shops that make things and use materials. Because there is only so much time, flour, or electricity, we cannot produce everything we want. They built a way to calculate exactly “how much to make of what” so that nothing is wasted and people become happiest. Thanks to their method, a cookie factory can use just the right amount of flour and sugar to bake the most cookies. Today, the same ideas secretly help factories, transport systems, and even game strategies all over the world.
Related Keywords
Linear programming
Linear programming is a mathematical technique for finding the best solution under objectives and constraints expressed as first-degree equations. Because both objective and constraints are linear, the feasible region forms a convex polytope. An important property is that an optimum always lies at a vertex, which underpins the simplex algorithm. The method is widely applied in logistics, finance, and energy operations, and modern solvers handle problems with millions of variables. It is the most direct tool for implementing the optimal allocation of resources honored by the Nobel Prize.
Shadow price
A shadow price is the marginal value indicating how much the objective would improve if a constraint were slightly relaxed. It corresponds to the dual variables obtained from a linear program and can be interpreted as the added value of one extra unit of a resource. In environmental policy, the shadow price of a carbon cap informs the level of a carbon tax. In corporate production planning, it signals the cost of scarce materials or machine time. By measuring scarcity in value rather than quantity, shadow prices are indispensable for economic assessment of resource allocation.
Duality theorem
In linear programming, every primal problem is paired with a dual problem. The duality theorem states that the optimal values of both problems coincide and that optimal solutions satisfy complementary slackness. This equality enables easy computation of bounds and sensitivity analysis. In economics, viewing the dual solutions as a price system permits integrated analysis of production and pricing. Computationally, it underlies dual simplex and interior-point methods that enhance efficiency.
Activity analysis
Activity analysis, advanced by Koopmans, represents production technologies as vectors and forms new activity levels through linear combinations. Assuming a convex technology set, cost minimization or profit maximization becomes a linear program. This makes it possible to evaluate firm-level or economy-wide efficiency mathematically. The concept underpins input–output tables and computable general equilibrium models. By abstracting the allocation problem, it quantitatively opened the study of multi-sector economies.
Resource allocation efficiency
Resource allocation efficiency describes a state where limited resources yield the greatest possible outcome, measured by criteria such as Pareto efficiency or cost minimization. Linear programming numerically identifies which input mix is efficient under given constraints. Improving efficiency brings social gains such as waste reduction and time savings, not just higher output. Governments use the concept for transport or medical resource planning, while firms optimize supply chains to stay competitive. The Nobel-winning work rigorously formalized efficiency and bridged it to real-world practice.
Constraint
A constraint in mathematical optimization is an equation or inequality that a solution must satisfy. Typical examples include upper limits on resources, technical specifications, and time windows. By embedding real physical or economic limits in the model, constraints make solutions implementable. In linear programming the coefficients are fixed numbers, giving the model a simple, computationally tractable structure. Studying constraints reveals bottlenecks and policy leverage points, creating a common ground for economics and engineering.