Formulating Linear Programming Model:

For attaining an optimal solution through LP, a set or region of optimal solution is attained. Initially the problem constraints are plotted on the graph. Whereas plotting the constraints of the problem the problem inequalities are transformed into equations. To plot the line for these equations, the general trend is to determine the points at which the line intersects the horizontal and vertical axis. Likewise second constraint is plotted in the form of equation.

After plotting the feasible region, the next step is to determine the optimal solution to the problem. There are various approaches that may be taken to solve the LP model for getting the optimal solution. The two methods generally utilised for finding the optimal solution are

• Iso-profit line method, and
• Corner point solution method.

Generally, many linear programming problems involve minimizing an objective such as cost or time. Such minimization problems may be solved graphically by first setting up the feasible solution region and then utilizing either of the aforementioned approaches to find the minimal solution.