notesonly.in

One notebook for every subject — open it anywhere.

Log in

Bounded and Unbounded Solutions: Explained with Examples

A bounded feasible region is enclosed on all sides, like a fenced field; a unbounded region stretches to infinity in some direction, like an open road. The solution is bounded when the objective function attains a finite best value, and unbounded when the objective can be pushed to infinity (or minus infinity) while staying feasible.

This distinction matters because an unbounded solution usually signals a modelling mistake — a forgotten budget limit or capacity constraint. Recognising it tells you to fix the problem statement rather than hunt for an answer that does not exist.

Key Concepts

  • Bounded set: fits inside some circle of finite radius; a bounded region always gives a finite optimum for a linear objective.
  • Unbounded set: extends infinitely far in at least one direction.
  • Unbounded solution: the objective value can be made arbitrarily large (for maximisation) while remaining feasible.
  • Unbounded region with bounded optimum: possible — a region can extend forever in a direction where the objective does not improve.

How It Works

  1. Draw all constraints and shade the feasible region.
  2. Ask whether the shaded region is enclosed on all sides (bounded) or open toward infinity (unbounded).
  3. If unbounded, check whether the objective function can keep improving along the open direction.
  4. If yes, the problem has an unbounded solution — no finite optimum exists; if no, the optimum still occurs at a corner.
  5. Never confuse unbounded with infeasible: unbounded means infinitely many feasible points, infeasible means none.

Worked Example

First, maximise Z = x + y subject to x + y ≤ 6, x ≥ 0, y ≥ 0. The feasible region is the triangle with corners (0, 0), (6, 0), (0, 6) — fully enclosed, so bounded. Evaluating: Z(0,0) = 0, Z(6,0) = 6, Z(0,6) = 6; the maximum is 6, a finite answer. Now maximise Z = x + y subject to x − y ≤ 2, x ≥ 0, y ≥ 0. Test the point (3, 50): 3 − 50 = −47 ≤ 2, feasible, and Z = 53. Test (5, 200): 5 − 200 = −195 ≤ 2, feasible, Z = 205. Since y can grow without limit while the constraint stays satisfied, Z grows without limit too — the solution is unbounded and no maximum exists. Note the contrast: the unbounded region has infinitely many feasible points, whereas an infeasible problem would have none.

Common Misconceptions

  • An unbounded region always means an unbounded solution. False — if the objective worsens along the open direction, the optimum is still finite and sits at a corner.
  • Unbounded and infeasible are the same. They are opposites: unbounded means the feasible set is too big, infeasible means it is empty.
  • Software will just give a big number. Proper solvers report "unbounded" as a diagnosis so you can add the missing constraint.

Real-World Applications

  • Detecting missing constraints in production models, such as a forgotten warehouse capacity.
  • Finance: an unbounded profit model warns that risk limits were left out of the portfolio plan.
  • Project scheduling: unbounded duration signals a missing deadline or resource cap.

Bounded regions give finite answers; unbounded objectives warn you that a limit is missing. Checking which case you have is an essential step before trusting any optimisation result.