If the corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5) then (maximum of \(z\) − minimum of \(z\)) for the objective function \(z=4x+6y\) is :
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → 60
The maximum and the minimum of z occur at corner points. Values of z = 4x + 6y:
\(z(0, 2) = 12\)
\(z(3, 0) = 12\)
\(z(6, 0) = 24\)
\(z(6, 8) = 24 + 48 = 72\)
\(z(0, 5) = 30\)
Maximum = 72, minimum = 12, so
\(72 - 12 = 60\)
NCERT Exemplar:
Linear Programming
