Given the following linear programming problem that minimizes cost:
Min Z = 2x + 8y
Subject to (1) 8x + 4y ? 64
&emsp; &emsp;&emsp; &emsp;(2) 2x + 4y ? 32
&emsp; &emsp;&emsp; &emsp;(3) y ? 2
-At the optimal solution, the minimum cost is:
A) $40
B) $50
C) $52
D) $53.33

Question

Quizplus · Accepted Answer

The constraints can be solved to find the feasible region. The optimal solution occurs at the intersection of constraints (2) and (3), which is (0, 2). Substituting into the objective function gives Z = 2(0) + 8(2) = 16, which is incorrect. Re-evaluating the constraints, the correct intersection is (4, 2), giving Z = 2(4) + 8(2) = 40.

Given the Following Linear Programming Problem That Minimizes Cost