Consider a LPP with objective function \( z=ax+by \). If its feasible region R is bounded, then \( z \)
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → has both maximum and a minimum value on R and each of these occurs at at least one corner point of R
This is the corner point theorem of linear programming.
If the feasible region R is bounded, the objective function z = ax + by has both a maximum value and a minimum value on R, and each of these occurs at a corner point (vertex) of R.
The maximum or minimum may also be attained at other points (for example, along a whole edge when z is parallel to that edge), but it is always attained at at least one corner point.
NCERT (2026-27 edition):
Graphical Method of Solving Linear Programming Problems
