PYQ Vault

MHT-CET Maths · Linear Programming

Reading Constraints Off a Shaded Region

Given a shaded region, recover its inequalities: write each boundary line from its intercepts, then pick a point inside the shading and test it against each line to fix ≥ or ≤.

Why this matters

9 PYQs at 22% HARD — the only page in the chapter with HARD questions, and both of them are here. The stems give a figure with three to five boundary lines and four option sets that differ only in the direction of one or two inequalities. The method is the half-plane test run backwards: one interior point, tested against one line at a time, eliminates the wrong options without ever sketching.

Concept 1 of 3

The Boundary Line From Its Intercepts: x/a + y/b = 1

Intuition

A line cutting the axes at (a,0)(a, 0) and (0,b)(0, b) is xa+yb=1\dfrac{x}{a} + \dfrac{y}{b} = 1, i.e. bx+ay=abbx + ay = ab. Read the intercepts off the figure and the equation writes itself; a line through the origin with slope mm is y=mxy = mx.

Definition

  • Intercepts 44 and 33: x4+y3=1⇒3x+4y=12\dfrac{x}{4} + \dfrac{y}{3} = 1 \Rightarrow 3x + 4y = 12. Intercepts 88 and 44: x+2y=8x + 2y = 8. Intercepts 55 and 22: 2x+5y=102x + 5y = 10.
  • A line through the origin and (1,1)(1, 1) is y=xy = x, written y−x=0y - x = 0 or x−y=0x - y = 0 in the options.
  • A line through (−1,0)(-1, 0) and (0,1)(0, 1) is y=x+1y = x + 1, i.e. y−x=1y - x = 1; the sign of the intercept decides the sign of the constant.
  • Horizontal and vertical boundaries are y=3y = 3 and x=4x = 4; these become y≤3y \le 3 or y≥3y \ge 3 in the constraint set.
  • Match each option's lines to the figure's lines FIRST; an option whose line does not appear in the figure at all is eliminated before any inequality is tested.

Intercept form

xa+yb=1  ⟺  bx+ay=ab\frac{x}{a} + \frac{y}{b} = 1 \iff bx + ay = ab

Worked example

A boundary line in a figure crosses the xx-axis at 66 and the yy-axis at 22. Write its equation.
Practice this conceptself-check · 4 quick reps

From the bank · past-year question

Example 1Linear ProgrammingMODERATE
If feasible region is as shown in the figure, then the related inequalities are

[Q108 · 9th May Shift 1 · 2024]

Swapping the intercepts

3x+4y=123x + 4y = 12 has xx-intercept 44, not 33. The coefficient of xx is the yy-intercept's number and vice versa; the option built on the swap is always offered.

Concept 2 of 3

Fix ≥ or ≤ With One Point Inside the Shading

Intuition

Pick a point visibly inside the shaded region, away from every boundary. Substitute it into each line's expression: if the value is below the constant the region is on the ≤\le side, if above, the ≥\ge side.

Definition

  • Region with boundaries x+2y=50x + 2y = 50, 2x+y=1002x + y = 100, 2x−y=02x - y = 0, interior point (10,40)(10, 40): 10+80=90≥5010 + 80 = 90 \ge 50, 20+40=60≤10020 + 40 = 60 \le 100, 20−40=−20≤020 - 40 = -20 \le 0. So x+2y≥50x + 2y \ge 50, 2x+y≤1002x + y \le 100, 2x−y≤02x - y \le 0.
  • If the origin is NOT inside the shading, the origin test still works in reverse: a line the shading is on the far side of gets the direction the origin FAILS.
  • Two constraints of the form x−y≥0x - y \ge 0, x+y≥0x + y \ge 0 describe a wedge to the right of the origin between the lines y=xy = x and y=−xy = -x; (2,0)(2, 0) settles both signs at once.
  • Non-negativity: if the shading touches an axis, x,y≥0x, y \ge 0 is part of the answer; options that omit it or misprint it (xy≥0xy \ge 0) are the same option in disguise.

Direction test

P inside the shading:aPx+bPy<c⇒ax+by≤c,>c⇒ax+by≥cP \text{ inside the shading:}\quad aP_x + bP_y < c \Rightarrow ax + by \le c,\qquad > c \Rightarrow ax + by \ge c

Worked example

A shaded region has boundaries x+y=6x + y = 6, x−y=2x - y = 2 and the axes, and the point (3,1)(3, 1) lies inside it. Write the constraints.
Practice this conceptself-check · 4 quick reps

From the bank · past-year question

Example 2Linear ProgrammingMODERATE
The shaded region in the following figure is the solution set of the inequations

[Q118 · 2nd May Shift 2 · 2023]

Testing a point on the boundary

(10,40)(10, 40) is a good test point precisely because it is nowhere near a line. A point on a boundary gives equality and decides nothing.

Concept 3 of 3

Four or Five Lines: Eliminate Options One Line at a Time

Intuition

With five boundaries and four options, do not reconstruct the whole region. Take the options' lines one at a time, decide the direction with your interior point, and strike out every option that disagrees — usually two lines are enough.

Definition

  • Boundaries 3x+8y=243x + 8y = 24, 4x+5y=204x + 5y = 20, 5x+3y=155x + 3y = 15 with the shading above the first line and below the other two: a point inside, (1,2.7)(1, 2.7), gives 3+21.6=24.6≥243 + 21.6 = 24.6 \ge 24, 4+13.5=17.5≤204 + 13.5 = 17.5 \le 20, 5+8.1=13.1≤155 + 8.1 = 13.1 \le 15. So 3x+8y≥243x + 8y \ge 24, 4x+5y≤204x + 5y \le 20, 5x+3y≤155x + 3y \le 15 — option (D). The region is thin, so the test point must be read off the figure, not guessed; that is what makes these two stems the chapter's only HARD ones.\n- The reliable route: identify which side of EACH line the shading sits by looking at the line and the shading directly (above/below, left/right), then convert: above a line with positive coefficients is ≥\ge, below is ≤\le.
  • Six-constraint stem with 2x+3y=62x + 3y = 6, 3x+6y=183x + 6y = 18, x−3y=3x - 3y = 3, −x+2y=2-x + 2y = 2: shading is above 2x+3y=62x + 3y = 6 (≥\ge), below 3x+6y=183x + 6y = 18 (≤\le), above x−3y=3x - 3y = 3 (x−3y≤3x - 3y \le 3, because larger yy makes x−3yx - 3y smaller), below −x+2y=2-x + 2y = 2 (≤\le).
  • Lines with a NEGATIVE coefficient reverse the intuition: 'above' the line x−3y=3x - 3y = 3 means x−3y≤3x - 3y \le 3. Compute the sign at a point rather than trusting above/below.

Elimination

for each line: decide the side→strike every option with the other sign→stop when one option is left\text{for each line: decide the side} \to \text{strike every option with the other sign} \to \text{stop when one option is left}

Worked example

Options (A)–(D) share the lines x+y=5x + y = 5, x−y=1x - y = 1, y=3y = 3 and differ in signs. The shading lies below x+y=5x + y = 5, above x−y=1x - y = 1, and below y=3y = 3. Write the constraints.
Practice this conceptself-check

From the bank · past-year question

Example 3Linear ProgrammingHARD
The function to be maximized is given by Z=3x+2yZ=3x+2y. The feasible region for this function is the shaded region given below, then the linear constraints for this region are given by

[Q129 · 10th May Shift 1 · 2023]

'Above the line' read as ≥ when a coefficient is negative

Above x−3y=3x - 3y = 3 is x−3y≤3x - 3y \le 3. Evaluate the expression at a point; never convert above/below to a sign by reflex.

Summary — formulas & gotchas at a glance

A revision cheat-sheet for the formulas and gotchas above. Click any concept name to jump back to its full explanation.

Formulas (3)

  • The Boundary Line From Its Intercepts: x/a + y/b = 1

    Intercept form

    xa+yb=1  ⟺  bx+ay=ab\frac{x}{a} + \frac{y}{b} = 1 \iff bx + ay = ab
  • Fix ≥ or ≤ With One Point Inside the Shading

    Direction test

    P inside the shading:aPx+bPy<c⇒ax+by≤c,>c⇒ax+by≥cP \text{ inside the shading:}\quad aP_x + bP_y < c \Rightarrow ax + by \le c,\qquad > c \Rightarrow ax + by \ge c
  • Four or Five Lines: Eliminate Options One Line at a Time

    Elimination

    for each line: decide the side→strike every option with the other sign→stop when one option is left\text{for each line: decide the side} \to \text{strike every option with the other sign} \to \text{stop when one option is left}

Watch out for (3)

Drill every past-year question on this subtopic

9 questions from the bank — paginated, with cart and Word-export support.

Related notes