The feasible region of a LPP is bounded. The corresponding objective function is \(Z= 6x - 7y\). Then objective function attains:
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → both maximum and minimum in the feasible region
By the corner point theorem of linear programming, when the feasible region is bounded, the objective function Z = ax + by has both a maximum value and a minimum value on it, and each occurs at a corner point of the region.
This holds for any linear objective function, so Z = 6x − 7y attains both a maximum and a minimum in the feasible region.
NCERT (2026-27 edition):
Graphical Method of Solving Linear Programming Problems
