If the feasible region of an LPP is bounded and the corresponding objective function is \(Z=5x-9y\), then the objective function attains:
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → both maximum and minimum values in the feasible region
By the corner point theorem of linear programming, when the feasible region is bounded, a linear objective function \(Z = ax + by\) has both a maximum and a minimum value, each attained at a corner point of the region.
This holds whatever the coefficients are, so \(Z = 5x - 9y\) attains both its maximum and its minimum value in the feasible region.
NCERT (2026-27 edition):
Graphical Method of Solving Linear Programming Problems
