Consider the linear programming problem
\[ Z_{\max} = 2x_1 + 5x_2 \quad \text{subject to the restrictions:} \]
\[ x_1 \leq 4 \]
\[ x_2 \leq 3 \]
\[ 2x_1 + 3x_2 \leq 14 \]
and $x_1 \geq 0, x_2 \geq 0$. Then the optimal solution is.
Show Hint
Notice $x_2$ has a much higher objective coefficient ($5$) than $x_1$ ($2$). To maximize $Z$, push $x_2$ to its upper bound $x_2 = 3$ first, then use $2x_1 + 3(3) = 14 \implies x_1 = 2.5$ to instantly get $Z = 2(2.5) + 5(3) = 20$!