Graphical Method Problems

Graphical method problems solve LPs with two decision variables by drawing the feasible region and moving objective contour lines.

When It Applies

Use graphical method when the LP has exactly two decision variables, usually $x_1$ and $x_2$.

Step 1: Plot Constraint Lines

Replace each inequality by equality.

Example:

\[x_1+2x_2\le 10\]

becomes:

\[x_1+2x_2=10.\]

Find two points on the line and draw it.

Step 2: Choose the Correct Half-Plane

Use a test point, usually $(0,0)$ if it is not on the line.

If the test point satisfies the inequality, shade the side containing it. Otherwise shade the other side.

Step 3: Find the Feasible Region

The feasible region is the intersection of all half-planes, including sign restrictions such as:

\[x_1\ge 0, \qquad x_2\ge 0.\]

Step 4: Use Objective Contours

For objective:

\[z=c_1x_1+c_2x_2,\]

contour lines are:

\[c_1x_1+c_2x_2=k.\]

They are parallel lines. Move them in the direction of improvement.

Step 5: Compute the Candidate Vertex

The optimum is usually at a vertex. Once the graphical solution points to a vertex, solve the two active boundary equations to get exact coordinates.

Outcomes

The graphical method may show:

  • unique optimum
  • multiple optima along an edge
  • infeasible problem
  • unbounded problem

Checklist

Always report:

\[x^*=(x_1^*,x_2^*)\]

and:

\[z^*=c^Tx^*.\]

See Also

Added drill source

Use Graphical Drill Set and Graphical Problems Without Nonnegativity for exam-style graphical practice.

Exam checkpoint

Practice under exam timing. Write the full pipeline: model, standard form if needed, BFS/reduced costs if asked, simplex iterations if asked, final objective value and interpretation.