Linear Programming

Linear programming (LP) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear equations. Linear programming can be applied to various fields of study. It is used most extensively in business and economics, but can also be utilized for some engineering problems.

Linear programming is a considerable field of optimization for several reasons. Many practical problems in operations research can be expressed as linear programming problems. The standard form of the linear programming problem is used to develop the procedure for solving a general programming problem.


Linear programming Constraints exist because certain limitations restrict the range of a variable's possible values. A constraint is considered to be binding if changing it also changes the optimal solution. Less severe constraints that do not affect the optimal solution are non-binding.

Important steps used while solving linear programming problems(LPP):-

Step 1: Interpret the given situations or constraints into inequalities.

Step 2: Plot the inequalities graphically and identify the feasible region.

Step 3: Determine the gradient for the line representing the solution (the linear objective function).

Step 4: Construct parallel lines within the feasible region to find the solution.