Concept

Linear programming

Maximising a linear expression subject to linear inequalities. Its optimum is always attained at a corner of the region the inequalities cut out, which is what makes it solvable and what makes the corners' arithmetic decide everything about it.

Named by 3 essays across one field — each of them below, with the objects they name alongside it.

Named alongside it

The objects these essays reach for when they reach for this one.

AssignmentMatchingIntegralityPolytopeAlgorithmBipartiteCertificateComplementary slacknessComplexityConvexityDualityExtreme point

All concepts