Linear programming is a way to determine the best outcome in a given mathematical model for some list of requirements represented as linear relationships. Linear programming is specific case of mathematical programming. Linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints. A linear programming algorithm finds a point in the polyhedron where this function has the smallest value if such point exists.

Linear programming can be applied to various fields of study. It is used in business and economics but is also utilized in engineering applications. Some industries that utilize linear programming models include transportation energy telecommunications and manufacturing. Many practical problems in operation research can be expressed as linear programming problems.

Standard form is the typical form of describing a linear programming problem. This form consists of three parts that are shown below:

**A linear function to be maximized**

F(x1, x2) = c1x1 + c2x2

**Problem constraints**

A11x1 + a12x2 <= b1

A21x1 + a22x2 <= b2

A31x1 + a32x2 <= b3

**Non negative variables**

X1>= 0

X2>= 0

The problem is usually expressed in matrix form and therefor becomes:

Ma{c^{T}x| Ax <= b ^ x >= 0}