Graph the memory and disk space constraints, shading the feasible region above both lines. Ensure x ≥ 0 and y ≥ 0. The overlapping shaded area represents the feasible region.
To draw the feasible region, let's denote the number of Pomegranate computers as x and the number of iZac computers as y.
The memory constraint is given by 800x + 1000y ≥ 860,000 GB, and the disk space constraint is 60x + 90y ≥ 72,000 TB.
Additionally, since the school cannot buy a negative number of computers, we have x ≥ 0 and y ≥ 0.
Now, let's graph these constraints. I'll describe the steps to draw the feasible region:
1. Draw the x-axis and y-axis.
2. Plot the lines 800x + 1000y = 860,000 and 60x + 90y = 72,000.
3. Shade the region above both lines to satisfy the inequality (because we have ≥ in both constraints).
4. Shade the region in the first quadrant (x ≥ 0 and y ≥ 0).
The point where the shaded regions overlap is the feasible region.
Complete question:
Enormous State University's Business School is buying computers. The school has two models to choose from: the Pomegranate and the iZac. Each Pomegranate comes with 800 GB of memory and 60 TB of disk space, and each iZac has 1000 GB of memory and 90 TB of disk space. For reasons related to its accreditation, the school would like to be able to say that it has a total of at least 860,000 GB of memory and at least 72,000 TB of disk space. Draw the feasible region that shows the number of each kind of computer it can buy. (Place the Pomegranate on the x-axis and the iZac on the y-axis. Select Update Graph to see your response plotted on the screen. Select the Submit button to grade your response.) memory restriction, 00, disk space restriction, 00, x ≥ 0, 0, 1