The corner points of the feasible region of a linear programming problem are $(0,4),(8,0)$ and $\left(\\;\frac{20}{3}, \\;\frac{4}{3}\right)$. If $Z=30 x+24 y$ is the objective function, then (maximum value of $Z$ - minimum value of $Z$ ) is equal to