Numerical Methods with Programming

A special but very important case of constrained optimization is minimizing a linear function on a set that is described by a set of linear inequalities or equations (a convex polyhedron). A large number of applied problems, for example in economics, can be modeled by a linear programming problem.