Skip to content
Exercise: Graphical Solution — Unboun... · Q21

Q.Solve graphically: Minimize Z=20x+10yZ = 20x + 10y subject to x+2y≥40, 3x+y≥30, x,y≥0x + 2y \ge 40,\ 3x + y \ge 30,\ x, y \ge 0. Does ZZ have a maximum value on this feasible region? Justify your answer.

West Bengal WbchseTextbookSubjectiveImportance★★★★★est
59% · 23/39 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 →

Concept understanding — Feasible and Infeasible Regions

The feasible region is bounded if it can be enclosed within some finite circle (typically when every non-trivial constraint is ≤\le type, confining the region near the origin), and unbounded if it extends without limit in some direction (typically when at least one constraint is ≥\ge type). For a bounded region, the largest/smallest value of ZZ among the corner points is automatically the true maximum/minimum. For an unbounded region, this must be confirmed with the half-plane test: if the open half-plane {ax+by>k}\{ax+by>k\} (for a maximum) or {ax+by<k}\{ax+by<k\} …

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.