Skip to content
NCERT Exemplar · Q28

Q.If the feasible region for a LPP is _________, then the optimal value of the objective function Z=ax+byZ = ax + by may or may not exist.

Sikkim CbseShort· 1mImportance★★★★★
64% · 43/67 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

For a Linear Programming Problem, if the feasible region is unbounded, the optimal value of Z=ax+byZ = ax + by may or may not exist — it depends on the direction of the objective function relative to the region's openness.

Why This Happens: The Concept of an Unbounded Feasible Region

In Linear Programming, the feasible region is the set of all points (x,y)(x, y) that satisfy all the constraints. When this region is bounded, it's a closed polygon — you can draw a circle around it. In that case, the maximum and minimum of any linear objective function Z=ax+byZ = ax + by are guaranteed to exist (by the Extreme Value Theorem), and they occur at one of the corner points.

But when the region is unbounded, it stretches out to infinity in at least one direction. Imagine a wedge that never closes — you can keep moving along it forever. Now, whether ZZ has an optimal value depends on which way you're trying to go.

If the objective function increases as you move outward in the unbounded direction, then ZZ can grow without bound — no maximum exists. If it decreases in that direction, the maximum might still be at a finite corner point. Similarly, the minimum might be at a corner, or it might not exist if the function keeps decreasing into infinity.

The key insight: unbounded region does not mean no optimum exists — it means the existence depends on the coefficients aa and bb in Z=ax+byZ = ax + by.

Step-by-Step Reasoning

  1. What "unbounded" means geometrically

    A feasible region is unbounded if it is not contained within any circle of finite radius. For example, the region x≥0,y≥0x \geq 0, y \geq 0 is unbounded — it extends infinitely in the positive xx and yy directions. In such a region, you can find points with arbitrarily large xx or yy coordinates.

  2. How the objective function behaves in an unbounded region

    Consider Z=ax+byZ = ax + by. If the region is unbounded in a direction where ZZ increases, then by moving further out, you can make ZZ arbitrarily large — so no maximum exists. Conversely, if ZZ decreases in that unbounded direction, the maximum might be at a finite corner point. The same logic applies to the minimum.

  3. A concrete example where the maximum exists

    Suppose the feasible region is x≥0,y≥0,x+y≥1x \geq 0, y \geq 0, x + y \geq 1 (unbounded above and to the right). Let Z=−x−yZ = -x - y. As xx and yy increase, ZZ becomes more negative — so the maximum occurs at the smallest possible x+yx+y, which is at the corner (0,1)(0,1) or (1,0)(1,0). Here, the maximum exists even though the region is unbounded.

  4. A concrete example where the maximum does not exist

    Same region x≥0,y≥0,x+y≥1x \geq 0, y \geq 0, x + y \geq 1, but now Z=x+yZ = x + y. As you move outward, ZZ increases without bound — no maximum exists. The minimum, however, exists at the corner points where x+y=1x+y=1.

  5. The general rule …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.