The Graphical Method is a simple and visual way to solve linear programming problems, especially when there are only two decision variables.



This method involves plotting the constraints as linear inequalities on an XY-plane. The region where all constraints overlap is called the feasible region. The solution lies at one of the corner points (vertices) of this region.

To find the optimal solution, you:

  1. Plot the constraints on a graph.
  2. Identify the feasible region.
  3. Calculate the value of the objective function at each corner point.
  4. Choose the point that gives the maximum or minimum value (as required).

It’s a quick and effective method for small problems and helps visualize how different constraints interact.