Consider the linear programming problem:
Maximize: \(z = \alpha x + 6y\)
Subject to the constraints
\(3x + 2y \leq 60\)
\(x + 2y \leq 40\)
\(x, y \geq 0\)
If every point in the line segment joining (20, 0) and (10, 15) is optimal solution of the L.P.P, then the value of \(\alpha\) is equal to