The function
\(Z= \alpha x + \beta y\ (\alpha, \beta \gt 0)\)
corresponds to the objective function of an LPP that needs to be maximized subject to
\(x+ y \le 1,\ x, y \ge 0\). Then the set of optimal solutions is:
Answer & explanation
Correct answer: option 4
The correct answer is Option (4) → {(t, 1 − t) : \(t \in [0, 1]\)} if \(\alpha = \beta\)
The feasible region is the triangle with corner points (0, 0), (1, 0) and (0, 1). It is bounded, so the maximum exists and is reached at a corner:
\(Z(0, 0) = 0,\quad Z(1, 0) = \alpha,\quad Z(0, 1) = \beta\)
If \(\alpha = \beta\), the maximum value \(\alpha\) is reached at both (1, 0) and (0, 1). Then every point of the edge joining them is also optimal, since on x + y = 1:
\(Z = \alpha x + \alpha y = \alpha(x + y) = \alpha\)
The points of that edge are (t, 1 − t) with \(t \in [0, 1]\), so the set of optimal solutions is {(t, 1 − t) : t ∈ [0, 1]}.
Why the other options are incorrect
Option (1) Empty set — Incorrect. The region is bounded, so a maximum always exists.
Option (2) {(1, 0)} if \(\alpha \lt \beta\) — Incorrect. If \(\alpha \lt \beta\), then Z(0, 1) = \(\beta\) is the largest value, so the optimal set is {(0, 1)}.
Option (3) {(0, 1)} if \(\alpha \gt \beta\) — Incorrect. If \(\alpha \gt \beta\), then Z(1, 0) = \(\alpha\) is the largest value, so the optimal set is {(1, 0)}.