Once you have mathematically formulated a linear programming problem, the next step is to actually solve it. In Class 12, you learn exactly one technique for this: the graphical method. It works only for problems with two decision variables, which is precisely why every LPP question in your syllabus involves just x and y.

This post explains how to graph the constraints of an LPP and, more importantly, how to interpret what that graph is telling you through concepts like the feasible region, feasible solutions, and infeasible solutions.

Why We Graph Constraints

Each constraint in an LPP is a linear inequality in two variables. From Class 11, you already know that a linear inequality like x + y ≤ 60 divides the coordinate plane into two half-planes: one where the inequality holds true, and one where it doesn’t. The boundary line itself (x + y = 60) is included when the inequality is ”≤” or ”≥.”

When you graph every constraint of an LPP on the same coordinate plane simultaneously, you are looking for the region where all the inequalities are true at the same time. That overlapping region is the single most important concept in this chapter.

What Is the Feasible Region?

The feasible region is the common area on the graph that satisfies every constraint of the problem, including x ≥ 0 and y ≥ 0. Because of these non-negative restrictions, the feasible region always lies within the first quadrant.

Using the furniture dealer example from earlier posts, with constraints 5x + y ≤ 100, x + y ≤ 60, x ≥ 0, and y ≥ 0, the feasible region turns out to be a four-sided shape bounded by the points O(0,0), A(20,0), B(10,50), and C(0,60). Every point inside this shape, or on its boundary, represents a combination of tables and chairs the dealer could realistically afford and store.

Feasible Region vs Infeasible Region

Any region of the graph that does not satisfy all the constraints simultaneously is called the infeasible region. Points here might satisfy one or two constraints but violate at least one other, making them impossible choices in the real-world scenario.

Feasible Solutions and Infeasible Solutions

Once the feasible region is identified, every point within it — inside the shape or exactly on its boundary — is called a feasible solution. For the furniture dealer, the point (10, 50) is feasible because it satisfies both 5x + y ≤ 100 and x + y ≤ 60. So are (0, 60) and (20, 0).

Conversely, any point outside the feasible region is an infeasible solution. For instance, (25, 40) fails 5(25) + 40 = 165 > 100, so it cannot be a valid choice even though it might look reasonable at first glance.

This distinction matters because an LPP can have infinitely many feasible solutions — every point in that shaded region counts — which is exactly why you need a systematic method (covered in the next post) to pick out the single best one.

Bounded and Convex: Two Key Properties

Two properties of the feasible region come up repeatedly in this chapter:

Convexity

Every feasible region formed from linear inequalities is a convex polygon. If you pick any two points inside it and draw a straight line between them, that entire line stays inside the region — there are no “dents” or concave notches. This property is what allows the Corner Point Method (discussed next) to work reliably.

Boundedness

A feasible region is bounded if it can be enclosed within a circle of finite radius — it does not stretch infinitely in any direction. The furniture dealer’s region is bounded because it is a closed quadrilateral. If it extends indefinitely, it is called unbounded, a special case explored later in this series.

How to Draw the Feasible Region — Step by Step

  1. Convert each inequality into an equation temporarily (replace ≤ or ≥ with =) to find the boundary line.

  2. Find two points on each line — typically the x-intercept (set y = 0) and the y-intercept (set x = 0) — and plot the line by joining them.

  3. Test the origin (0,0) in each original inequality (unless the line itself passes through the origin) to determine which side of the line to shade.

  4. Shade the region satisfying all constraints simultaneously, including x ≥ 0 and y ≥ 0, which restricts everything to the first quadrant.

  5. Identify the corner points of the resulting shaded polygon — these are the points where two boundary lines intersect, and they will become essential in the next stage of solving the problem.

Why This Step Cannot Be Skipped

Some students jump straight to computing values at guessed points, but the feasible region graph confirms which points are even valid. Skipping this step risks evaluating the objective function at a point that looks promising but is actually infeasible — and in board exams, an accurate, correctly shaded graph is also worth dedicated marks.

Sharpen Your Graphing Skills with ChampionsPrep

Reading and shading feasible regions accurately takes practice under exam-like conditions. ChampionsPrep offers AI-powered, chapter-wise practice sessions with PrepCoin packs from ₹59, built specifically for CBSE and Maharashtra State Board Class XI–XII Commerce students, along with focused preparation for CUET, IPMAT, JIPMAT, NPAT, and SET. Practise identifying feasible regions and corner points until the graphical method becomes second nature — start your session on ChampionsPrep today.

Graphical Method of Solving LPP: Understanding the Feasible Region podcast artwork
Audio LessonClass 12

Graphical Method of Solving LPP: Understanding the Feasible Region

ChampionsPrep MathematicsEpisode 1258:19

Subscribe in any podcast app:

Frequently Asked Questions

What is a feasible region in linear programming? +

The feasible region is the common area on a graph that satisfies all the constraints of a linear programming problem simultaneously, including the non-negative restrictions.

What is the difference between a feasible solution and an infeasible solution? +

A feasible solution is any point within or on the boundary of the feasible region, satisfying all constraints. An infeasible solution lies outside this region and violates at least one constraint.

Why is the feasible region always a convex polygon? +

Because it is formed by the intersection of linear inequalities, and any such intersection region has the property that a straight line between any two points inside it stays entirely within the region.

What does it mean if a feasible region is bounded? +

A bounded feasible region can be enclosed within a circle of finite radius, meaning it does not extend infinitely in any direction, unlike an unbounded region.

How do you decide which side of a boundary line to shade? +

Test a convenient point, usually the origin (0,0), in the original inequality. If it satisfies the inequality, shade the side containing that point; if not, shade the opposite side.