Linear programming is defined as a method of either maximizing or minimizing linear functions which are subjected to equality or inequality constraints. The linear inequalities which are formed are on the basis of certain situations of the problem and the objective of the linear programming is to optimize the solution finding out the best possible solution to the problem. The constraints are the limitations of the problem. For example we can take up the limitations of resources in terms of materials and labour and then finding out the best possible way to maximize the profit of the organization under the constraints or limitations of material and labour. The steps to solve linear programming are to graph the linear inequalities first which is known as the constraints. The linear inequalities then bounds an area known as the feasibility region and the points at which each of the constraints crosses each other are known as the corner points. The coordinates of the corner points are found out and then plugged into each of the linear inequality or optimization equation to find out the maximum or minimum values.