Here are the steps to solve a Linear Programming Problem (LPP) using the Graphical
Method:
✅ Step 1: Formulate the Problem
Objective Function: Clearly state whether it’s a Maximization or Minimization
problem.
Example: Maximize Z=3x+4yZ = 3x + 4y
Constraints: Express the given conditions as linear inequalities.
Example:
{x+2y≤10x≥0y≥0\begin{cases} x + 2y \leq 10 \\ x \geq 0 \\ y \geq 0 \end{cases}
✅ Step 2: Convert Inequalities into Equations
For each inequality, temporarily change ≤\leq, ≥\geq, or <<, >> into an equation (e.g.,
x+2y=10x + 2y = 10) to plot the lines.
✅ Step 3: Draw the Constraint Lines on a Graph
Plot each equation as a straight line on a graph using intercepts or any two points.
Use a suitable scale on both axes.
Mark each line clearly.
✅ Step 4: Identify the Feasible Region
For each constraint:
o Test a point (usually the origin (0,0)(0,0)) in the inequality.
o Shade the side of the line that satisfies the inequality.
The feasible region is where all shaded areas overlap (common area).
Ensure to include non-negativity constraints (x≥0x \geq 0, y≥0y \geq 0) to restrict the
solution to the first quadrant.
✅ Step 5: Identify Corner Points (Vertices) of the Feasible Region
Find the intersections of lines that bound the feasible region.
These points can be:
o Intersections of constraint lines.
o Intersections with axes.
Solve the equations of intersecting lines to find exact coordinates.
✅ Step 6: Evaluate the Objective Function at Each Corner Point
Substitute each corner point into the objective function Z=ax+byZ = ax + by.
Calculate the value of ZZ at each point.
✅ Step 7: Identify the Optimal Solution
For Maximization: Choose the point with the maximum value of ZZ.
For Minimization: Choose the point with the minimum value of ZZ.
That point gives the optimal solution.
✅ Step 8: Conclusion
Write the optimal values of xx, yy, and ZZ.
Verify the solution satisfies all original constraints.
Would you like to see a fully solved example with a graph?
