Linear programming
Named by 3 essays across one field — each of them below, with the objects they name alongside it.
The corners are whole assignments
A table of shares can be written as a lottery over whole assignments, which the anchor's first rung demonstrates on one example. The general statement is that the corners of the set of such tables are exactly the whole assignments, and that single fact is why the whole subject is easy.
A price for every person and task
The cheapest assignment can be found without comparing it to any other. Attach a number to each person and each task so that no pair's two numbers exceed its cost, and if the numbers add to an assignment's total, that assignment is cheapest — proved, by an argument that never mentions the alternatives.
Where the corners stop being whole
Everything on this ladder rests on one property — the relaxation of the assignment problem has whole-numbered corners. Add a single edge that closes an odd cycle and the property fails, a corner appears with a half in every coordinate, and the problem changes character completely.
Named alongside it
The objects these essays reach for when they reach for this one.
AssignmentMatchingIntegralityPolytopeAlgorithmBipartiteCertificateComplementary slacknessComplexityConvexityDualityExtreme point