Consider the Following Linear Programming Problem: Minimize $Z = \$ 2 x + \$ 8 y$

Essay

Consider the following linear programming problem: Minimize $Z = \$ 2 x + \$ 8 y$
$$\begin{array} { l } \text{Subject to:}&8 x + 4 y \geq 64 \\&2 x + 4 y \geq 32 \\&y \geq 2\end{array}$$ Determine the optimum amounts of x and y in terms of cost minimization. What is the minimum cost?