Linear programming (LP),involves minimizing or maximizing a linear 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:

\[\min_{x} \left\{f^{\mathsf{T}}x\right\}\]

Subject to the contraints:

\[\begin{eqnarray}Ax \leq b & \quad & \text{(inequality constraint)} \\A_{eq}x = b_{eq} & \quad & \text{(equality constraint)} \\lb \leq x \leq ub & \quad & \text{(bound constraint)}\end{eqnarray}\]

The following algorithms are commonly used to solve linear optimization problems:

**Interior point:**Uses a primal-dual predictor-corrector algorithm and is especially useful for large-scale linear programs that have structure or can be defined using sparse matrices.**Active-set:**Minimizes the objective of the linear optimization problem at each iteration over the active set (a subset of the constraints that are locally active) until it reaches a solution.**Simplex:**Uses a systematic procedure for generating and testing candidate vertex solutions to a linear program. The simplex algorithm and the related dual-simplex algorithm are the most widely used algorithms for linear programming.

For more information on algorithms and linear programming, see Optimization Toolbox™.