If the feasible region R for a linear programming problem is bounded, then the objective function Z = Ax + By has
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → Both maximum and minimum value on R
By the corner point theorem of linear programming: if the feasible region R is bounded, the objective function Z = Ax + By has both a maximum and a minimum value on R, and each of them occurs at a corner point of R.
Only when R is unbounded may a maximum or a minimum fail to exist.
NCERT (2026-27 edition):
Graphical Method of Solving Linear Programming Problems
