Linear Programming is Geometry
A lightweight execution-visualization book.
Half-Planes & Regions
A Linear Inequality Is a Half-Plane
Constraints Intersect into a Polytope
Vertices & the Objective
The Corner as a Two by Two Solve
The Objective Is a Sliding Contour
The Optimum Is a Vertex
Every Case Off the Geometry
Enumerate and Evaluate
Unbounded and Infeasible