Linear Programming • Old name for linear optimization – Linear objective functions and constraints • Optimum always at boundary of feasible domain • First solution algorithm, Simplex algorithm developed by George Dantzig, 1947 – What is a simplex (e.g. triangle, tetrahedron)? • We will study limit design of