Linear Programming

A linear programming problem is a constrained optimization problem where both the objective function and all constraints are linear. This lecture demonstrates the geometry of the simplex algorithm on a simple 2-dimensional problem. The classical example of the diet problem is shown, using a tutorial of JuMP, a Julia package. The lecture ends with two pointers to the literature on linear programming and suggestions for topics for computational projects.