Latest

From LP to IP: why integrality matters, LP relaxations, and why rounding fails.

Branch and bound: the workhorse algorithm for integer programming, explained with a complete knapsack example.

Cutting planes and branch-and-cut: tightening LP relaxations and how modern solvers solve integer programs.

An introduction to linear programming: definitions, standard form, geometric intuition, and practical examples.

The simplex method explained: slack variables, tableaux, pivoting, degeneracy, and a complete worked example.