• Practice
  • About 15 min
  • 5 practice questions

Writing the constraints from a picture, and the area of the feasible region

Go backwards from the corner points of a region to its inequalities, test the interior to choose the signs, find the area of the region by the shoelace method, and count whole-number points in it.

If something looks wrong, please tell us.

Some exam questions give you the picture, or its corner points, and ask for the inequalities. Others ask for the area of the feasible region. Both are quick marks if you have a routine. This lesson gives one.

From corners to inequalities

  • Join the corner points in order around the region to get the edges.
  • For each edge, find the equation of the line through its two end points (slope first, then substitute one point).
  • Pick a point inside the region (for instance the average of the corners) and substitute it into the left side of each line. If the result is less than the constant, the inequality is ≤; if greater, ≥.
  • Add x ≥ 0 and y ≥ 0 if the region lies in the first quadrant and touches the axes.

An edge through (x₁, y₁) and (x₂, y₂) has equation (y − y₁)(x₂ − x₁) = (x − x₁)(y₂ − y₁). Test an interior point to choose ≤ or ≥.

Worked example 1: a four-sided region

A region has corners (0, 0), (6, 0), (4, 3) and (0, 5). Find its inequalities. The edge from (6, 0) to (4, 3) has slope (3 − 0)/(4 − 6) = −3/2, so y = −(3/2)(x − 6), that is 3x + 2y = 18. Check (4, 3): 12 + 6 = 18. The edge from (4, 3) to (0, 5) has slope (5 − 3)/(0 − 4) = −1/2, so x + 2y = 10; check (4, 3): 4 + 6 = 10, and (0, 5): 10. The interior point (1, 1) gives 3 + 2 = 5 < 18 and 1 + 2 = 3 < 10, so both are ≤. The region is x ≥ 0, y ≥ 0, 3x + 2y ≤ 18, x + 2y ≤ 10.

Area by the shoelace method

List the corners in order, either direction: (x₁, y₁), (x₂, y₂), … , (xₙ, yₙ), and return to the first. The area is ½ |Σ (xᵢ yᵢ₊₁ − xᵢ₊₁ yᵢ)|. For the region above, with corners (0, 0), (6, 0), (4, 3), (0, 5): the terms are 0·0 − 6·0 = 0; 6·3 − 4·0 = 18; 4·5 − 0·3 = 20; 0·0 − 0·5 = 0. The sum is 38, so the area is 19 square units. As a check, split the region into the triangle (0, 0), (6, 0), (4, 3) of area ½ × 6 × 3 = 9 and the triangle (0, 0), (4, 3), (0, 5) of area ½ × 5 × 4 = 10. The total is 19.

Worked example 2: a triangle and its whole-number points

The region is x ≥ 2, y ≥ 1 and x + y ≤ 9. Its corners are (2, 1), (8, 1) and (2, 7). It is a right triangle with legs of length 6, so its area is ½ × 6 × 6 = 18. To count the points with whole-number coordinates (a common question when the answer must be whole), go column by column. For x = 2, y can be 1 to 7, which is 7 values; for x = 3, y runs from 1 to 6, giving 6; and so on down to x = 8, which gives 1. The total is 7 + 6 + 5 + 4 + 3 + 2 + 1 = 28 points. Note that the area (18) is not the number of lattice points (28), because points on the boundary count as well.

How many constraints are really needed?

A constraint is redundant if removing it leaves the region unchanged. For a bounded region, a quick test is to see whether all the corners of the other constraints satisfy it; for an unbounded region, also check that it keeps holding as you move off along the directions in which the region is unbounded. In the diet region 4x + 2y ≥ 16, x + 3y ≥ 9, with x, y ≥ 0, the corners are (0, 8), (3, 2) and (9, 0). The extra constraint x + y ≥ 4 holds at all three (8, 5 and 9 are each at least 4), and x + y only grows as the region runs off to the right or upwards, so x + y ≥ 5 throughout and the constraint changes nothing. Redundant constraints can appear in a problem as distractors.

Key takeaways: find each edge's line from two corners; choose ≤ or ≥ by testing an interior point; the shoelace formula gives the area from the ordered corners; lattice-point counts need a column-by-column count; a constraint that every corner already satisfies is redundant for a bounded region; for an unbounded one, check the unbounded directions too.

Check your understanding

  1. 1. What is the equation of the line through (6, 0) and (0, 4)?

    1. 3x + 2y = 12
    2. 2x + 3y = 12
    3. 2x + 3y = 24
    4. x + y = 10
    Show answer

    Answer: B. The intercept form x/6 + y/4 = 1 gives 2x + 3y = 12. Check: 2(6) = 12 and 3(4) = 12.

  2. 2. A region contains the interior point (1, 1), and one boundary is the line 3x + 2y = 18. Which inequality describes it?

    1. 3x + 2y ≥ 18
    2. 3x + 2y = 5
    3. 3x − 2y ≤ 18
    4. 3x + 2y ≤ 18
    Show answer

    Answer: D. At (1, 1) the left side is 5, which is less than 18, so the region is on the ≤ side.

  3. 3. Using the shoelace method, what is the area of the triangle with corners (0, 0), (4, 0), (0, 6)?

    1. 12
    2. 24
    3. 10
    4. 6
    Show answer

    Answer: A. The terms are 0·0 − 4·0 = 0; 4·6 − 0·0 = 24; 0·0 − 0·6 = 0. The sum is 24, so the area is 12.

  4. 4. How many points with whole-number coordinates satisfy x ≥ 0, y ≥ 0, x + y ≤ 4?

    1. 10
    2. 16
    3. 15
    4. 20
    Show answer

    Answer: C. For x = 0, 1, 2, 3, 4 there are 5, 4, 3, 2, 1 values of y. The total is 15.

  5. 5. In the diet region with corners (0, 8), (3, 2) and (9, 0), the constraint x + y ≥ 4 is:

    1. binding at the corner (3, 2) itself
    2. violated at the corner (9, 0) here
    3. an equality constraint on the region
    4. redundant: x + y is at least 5 here
    Show answer

    Answer: D. The sums x + y at the corners are 8, 5 and 9, and x + y only grows along the directions in which the region is unbounded, so x + y ≥ 5 throughout and removing the constraint changes nothing.

Sign in to keep track of the lessons you finish.

Next lesson → Diet and blending problems at speed

Privacy · Terms · Refunds · Delivery