• Practice
  • About 17 min
  • 5 practice questions

Unbounded regions: exam traps and quick checks

Decide quickly whether an optimum exists on an unbounded region: confirm a minimum with a combination of the constraints, recognise a maximum that does exist, and handle objectives with negative coefficients.

If something looks wrong, please tell us.

The foundation course gave the open half-plane test for unbounded regions. Exams test it with traps: a maximum that exists although the region is unbounded, a negative coefficient that reverses the usual pattern, and options such as "no minimum exists" placed next to a correct-looking corner value. This lesson gives a fast algebraic check and the patterns to look out for.

The combination check

On a region given by ≥ constraints, suppose the objective can be written as a combination of the constraint expressions with non-negative multipliers. Then the constraints give a lower bound for Z. If that bound equals the candidate corner value, the minimum is confirmed, with no drawing needed. To find the multipliers, match the coefficients of x and y; with two constraints this is two equations in two unknowns.

Worked example 1: confirming a minimum

Minimise Z = 4x + 5y subject to 2x + y ≥ 10, x + 3y ≥ 15, x, y ≥ 0. Corners: (0, 10), (15, 0) and the intersection y = 10 − 2x, x + 30 − 6x = 15, so x = 3, y = 4. Z = 50, 60 and 32; the candidate is 32. Combination: 4x + 5y = a(2x + y) + b(x + 3y) needs 2a + b = 4 and a + 3b = 5, so a = 7/5 and b = 6/5, both positive. Therefore 4x + 5y ≥ (7/5)(10) + (6/5)(15) = 14 + 18 = 32. The minimum is 32 at (3, 4). If a multiplier came out negative, the check fails and you must use the half-plane test instead.

If Z = a·(left side of constraint 1) + b·(left side of constraint 2) with a, b ≥ 0 and the constraints are ≥ c₁ and ≥ c₂, then Z ≥ ac₁ + bc₂. When this equals the best corner value, that value is the minimum.

Worked example 2: a maximum on an unbounded region

Maximise Z = x − 2y subject to x + y ≥ 4, x − y ≤ 2, x, y ≥ 0. The x-axis gives no corner (x ≤ 2 and x ≥ 4 clash), so the corners are (0, 4) and (3, 1), where x + y = 4 meets x − y = 2. Z = −8 and 1. The region runs off upwards, and in it y grows at least as fast as x, which makes x − 2y fall. Algebra settles it: subtracting x − y ≤ 2 from x + y ≥ 4 gives 2y ≥ 2, so y ≥ 1, and then x − 2y = (x − y) − y ≤ 2 − 1 = 1. The maximum is 1 at (3, 1), even though the region is unbounded. The same region has no minimum of Z, since (0, y) gives −2y.

Worked example 3: negative coefficients

On the region of example 1, find the maximum of Z = −4x − 5y. Since −4x − 5y = −(4x + 5y), its maximum is minus the minimum of 4x + 5y: −32 at (3, 4). On the other hand, the maximum of 4x + 5y does not exist, since (100, 0) is feasible and gives 400. Exams like to give both questions on one region.

Region and objectiveUsual outcome
≥ constraints in the first quadrant, minimise px + qy with p, q > 0minimum exists at a corner
same region, maximise px + qy with p, q > 0no maximum
same region, an objective with a negative coefficienttest carefully: often neither exists
region squeezed between two lines going off to infinitycheck the direction of travel; an optimum may exist

Key takeaways: on an unbounded region never write a corner value as the answer without a check. Use a non-negative combination of the constraints as a one-line proof of a minimum, use a feasible far-away point as a one-line proof that none exists, and turn maximising −Z into minimising Z.

Check your understanding

  1. 1. Minimise Z = 5x + 6y subject to 3x + 2y ≥ 12, x + 2y ≥ 8, x, y ≥ 0.

    1. 28
    2. 36
    3. 40
    4. No minimum exists
    Show answer

    Answer: A. Corners: (0, 6), (2, 3) where the lines meet (subtracting gives 2x = 4), and (8, 0). Z = 36, 28, 40. Confirm the candidate 28: 5x + 6y = 1(3x + 2y) + 2(x + 2y) ≥ 12 + 16 = 28, so nothing in the region is below 28. Minimum 28 at (2, 3).

  2. 2. The region x − y ≤ 1, x + 2y ≥ 4, x, y ≥ 0 is unbounded, with corners (0, 2) and (2, 1). What is the maximum of Z = x − 3y?

    1. −6
    2. No maximum exists
    3. 1
    4. −1
    Show answer

    Answer: D. Corner values: −6 at (0, 2) and −1 at (2, 1). Subtracting x − y ≤ 1 from x + 2y ≥ 4 gives 3y ≥ 3, so y ≥ 1 everywhere in the region. Then x − 3y = (x − y) − 2y ≤ 1 − 2 = −1. So no feasible point beats −1, and the maximum is −1 at (2, 1).

  3. 3. On the region 3x + 2y ≥ 12, x + 2y ≥ 8, x, y ≥ 0, what is the maximum of Z = −5x − 6y?

    1. −40
    2. −28
    3. −36
    4. No maximum exists
    Show answer

    Answer: B. Maximising −(5x + 6y) is the same as minimising 5x + 6y and changing the sign. The minimum of 5x + 6y is 28, so the maximum of Z is −28, at (2, 3). It exists even though the region is unbounded.

  4. 4. The region 2x + y ≥ 6, x + y ≥ 4, x, y ≥ 0 is unbounded. Which objective has NO minimum on it?

    1. Z = x + y
    2. Z = 3x + 2y
    3. Z = x − y
    4. Z = 2x + 5y
    Show answer

    Answer: C. Any objective with both coefficients positive is at least 0 on the first quadrant and attains a minimum at a corner. Z = x − y has a negative y coefficient, and the region contains (0, y) for every y ≥ 6, where Z = −y falls without limit. So x − y has no minimum.

  5. 5. Which statement is true for Z = px + qy with p > 0 and q > 0, on a non-empty feasible region lying in the first quadrant?

    1. Z never has a minimum if the region is unbounded
    2. Z has a minimum only if the region is bounded
    3. Z always has its minimum at the origin
    4. Z always has a minimum, even if the region is unbounded
    Show answer

    Answer: D. In the first quadrant Z = px + qy ≥ 0, so Z cannot fall without limit, and a linear objective that is bounded below on such a region attains its minimum at a corner. The origin is the minimum only if it is feasible. The maximum is the one that can fail to exist.

Privacy · Terms · Refunds · Delivery