##### Asked by: Hoummada Kerstingaufderheide

asked in category: General Last Updated: 6th March, 2020# How many steps are there to obtain the solution of LP model by graphical model?

**Graphical**method of

**linear programming**is used to solve problems by finding the highest or lowest point of intersection between the objective function line and the feasible region on a graph. This process can be broken down into 7 simple

**steps**explained below.

Consequently, how graphical method solves linear programming problems?

**The Graphical Method**

- Step 1: Formulate the LP (Linear programming) problem.
- Step 2: Construct a graph and plot the constraint lines.
- Step 3: Determine the valid side of each constraint line.
- Step 4: Identify the feasible solution region.
- Step 5: Plot the objective function on the graph.
- Step 6: Find the optimum point.

Secondly, how do you solve a feasible region? The **feasible region** is the **region** of the graph containing all the points that satisfy all the inequalities in a system. To graph the **feasible region**, first graph every inequality in the system. Then find the area where all the graphs overlap. That's the **feasible region**.

Subsequently, one may also ask, what is unbounded solution?

An **unbounded solution** of a linear programming problem is a situation where objective function is infinite. A linear programming problem is said to have **unbounded solution** if its **solution** can be made infinitely large without violating any of its constraints in the problem.

What is an optimal solution?

An **optimal solution** is a feasible **solution** where the objective function reaches its maximum (or minimum) value – for example, the most profit or the least cost. A globally **optimal solution** is one where there are no other feasible **solutions** with better objective function values.