Linked from

The 61 pages that link to Linear programming, each with the reason it gives.

• Radon's theoremRelated: Linear constraints can encode convex combinations and test whether two hulls intersect.

• Hungarian algorithmRelated: The assignment problem has a linear-programming formulation that underlies optimality arguments.

• Kepler conjectureRelated: Several finite estimates in the proof are certified through linear-programming bounds.

• Blossom algorithmNarrower topic: Edmonds connected matching algorithms to the geometry of linear optimization.

• Elementary algebraRelated: It applies linear equations and inequalities to constrained optimization.

• Ellipsoid methodRelated: Khachiyan's polynomial-time result concerned linear programming, even though the method is broader.

• Management scienceBroader topic: It models resource-allocation choices such as production planning and staffing.

• Managerial economicsRelated: It can allocate limited labor, materials, or capacity across competing uses.

• Theory of computationRelated: Its polynomial-time solvability contrasts with the hardness of many discrete optimization problems.

• Balinski's theoremRelated: Polytope graphs encode adjacency among feasible solutions in linear programming.

• Margaret H. WrightRelated: Linear programming is a foundational optimization problem related to her broader algorithmic work.