This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Linear programming duality | |
|---|---|
| Name | Linear programming duality |
| Field | Optimization |
| Introduced | 1947 |
| Key people | John von Neumann, George Dantzig, Philip Wolfe, L. V. Kantorovich |
Linear programming duality. Linear programming duality is a fundamental principle in mathematical optimization connecting every linear programming instance to a corresponding dual instance whose solutions and bounds mirror those of the original problem; it underpins theoretical results and practical algorithms across operations research, computer science, economics, and engineering. The concept emerged from mid‑20th‑century developments involving figures such as John von Neumann, George Dantzig, and L. V. Kantorovich, and it informs modern methods including the simplex algorithm, interior point method, and network flow techniques.
Duality links a "primal" linear programming problem to a "dual" problem in a way that objective values provide bounds on each other and optimality conditions can be characterized via complementary relations; this correspondence shaped key advances by John von Neumann in game theory, by L. V. Kantorovich in resource allocation, and by George Dantzig in algorithmic development. Duality plays a central role in theoretical results such as the minimax theorem, in computational frameworks like the simplex algorithm by George Dantzig and Phillip Wolfe, and in economic theory influenced by Paul Samuelson and Kenneth Arrow.
Given a primal formulation in standard forms, one constructs a dual by transposing constraints into variables and variables into constraints; classical correspondences were systematized in work by John von Neumann and applied in contexts including transportation problems and assignment problems. For example, a primal minimization with inequality constraints yields a dual maximization with sign conditions, reflecting transformations used in approaches pioneered by L. V. Kantorovich, Tjalling Koopmans, and later formalized in texts by George Dantzig and Albert W. Tucker.
Weak duality asserts that any feasible dual objective value bounds feasible primal values, a principle that predates algorithmic proofs and is conceptually tied to results from John von Neumann and the minimax theorem; strong duality states equality of optimal objective values under suitable regularity, as in the classical simplex analysis by George Dantzig and proofs using separating hyperplane theorems related to work by Hahn and Banach. Strong duality underpins optimality proofs for methods like the interior point method developed by Karmarkar and later refined by researchers associated with AT&T Bell Laboratories and IBM Research.
Complementary slackness conditions characterize optimality by linking primal and dual variables: a primal constraint slack implies the corresponding dual variable is zero and vice versa, a criterion employed in sensitivity analysis in economics by Paul Samuelson and used in algorithmic recovery of primal solutions from dual iterates in algorithms by George Dantzig and Philip Wolfe. These conditions are essential in applications ranging from supply chain optimization studied by MIT groups to auction theory analyzed by researchers at Harvard University and Stanford University.
Standard transformations—such as converting between equality and inequality constraints, introducing slack and surplus variables, and applying variable sign changes—produce precise dual forms; these techniques appear in canonical texts by George Dantzig and in coursework from institutions including Massachusetts Institute of Technology and Princeton University. Matrix formulations linking primal and dual via transposition relate to linear algebraic foundations developed by mathematicians associated with University of Göttingen and Princeton University, and are implemented in software packages originating at Bell Labs and commercial vendors like IBM and Microsoft.
Dual variables are often interpreted as shadow prices in production, allocation, and resource valuation models popularized by L. V. Kantorovich and discussed by Kenneth Arrow and Gerard Debreu; duality yields comparative statics and welfare insights in models taught at London School of Economics and Harvard University. Geometrically, duality corresponds to supporting hyperplanes and polar polyhedra, concepts rooted in convex analysis influenced by work at École Polytechnique and University of Chicago, and tied to separation theorems associated with Hahn and Banach.
Duality is exploited across algorithms—dual simplex methods, primal‑dual interior point methods, and decomposition schemes like Dantzig–Wolfe decomposition—with historical contributions from George Dantzig, Philip Wolfe, and researchers at Bell Labs and RAND Corporation. Practical applications span transportation problems, network flow optimization such as the max‑flow min‑cut theorem developed by L. R. Ford Jr. and D. R. Fulkerson, resource allocation in industries guided by Kantorovich’s work, and large‑scale scheduling in organizations like NASA and Boeing.