Formulating and solving linear programmes
Choose decision variables, write linear constraints and a linear objective. The feasible region is a polygon, and the optimum lies at a vertex: slide the objective line across, or test every vertex. The simplex method does the vertex-hopping algebraically, using slack variables and pivots.
≈ 50 min