Linear programming (LP) involves minimizing or maximizing an objective function subject to bounds, linear equality, and inequality constraints. Example problems include design optimization in engineering, profit maximization in manufacturing, portfolio optimization in finance, and scheduling in energy and transportation.
Linear programming is the mathematical problem of finding a vector x that minimizes the function:
Subject to the constraints:
The following algorithms are commonly used to solve linear programming problems:
For more information on algorithms and linear programming, see Optimization Toolbox.