Operations Research / Optimization
Operations research from its exact optimum outward — starting with linear programming as geometry, where a two-variable LP's optimum sits at a rational vertex of the feasible polytope, proven by the constraints themselves rather than read off a solver's float, with every value pinned and every diagram validated.
5 books, 36 pages, 15 chapters.
Books
- Linear Programming is Geometry - 7 pages, 3 chapters
- Simplex, Pivot by Pivot - 8 pages, 3 chapters
- Duality as a Certificate - 7 pages, 3 chapters
- Integer Programming & Branch-and-Bound - 7 pages, 3 chapters
- Knapsack and the DP Table - 7 pages, 3 chapters