A system of inequalities models a shipment with both a minimum capacity and a maximum preparation time. Graph the inequalities in Desmos and look at the highest overlap to find which large-crate counts are worth testing. The graph includes fractional coordinates, though, so its top point may not describe a real shipment. Check whole-number crate counts near that point against both limits.
Hints
- Hint 1
For capacity, multiply each crate count by the space that kind holds, then add. For preparation time, do the same with minutes. Which inequality symbol matches at least, and which matches no more than?
- Hint 2
The overlap is where both shaded regions meet, so every point there passes both limits. Look at its highest point to find an upper bound on , but remember that crate counts must be whole numbers.
- Hint 3
Test the highest plausible whole-number first. A horizontal line through that height shows which values satisfy both limits. Does that interval contain a whole-number ?
Step-by-step
Graph the limits, then check whole-number points
Step 1Translate the shipment limits
The small crates contribute cubic units and the large crates contribute , so at least gives . Preparation takes minutes, so no more than gives . Also, and must be nonnegative integers.
- Step 2
Find the highest part of the overlap
Type the four inequalities into Desmos. The overlap is where every shaded region meets. Click where the capacity and time boundary lines cross: Desmos shows about . This is the highest point of the overlap, so cannot work. The largest whole-number height still worth testing is .
- Step 3
Rule out the highest candidate
Add and click where it meets each boundary of the overlap. Desmos shows and , so would have to be between and . There is no whole-number in that interval. Only integer points in the overlap represent shipments.
- Step 4
Check the next whole-number count
Try . Those large crates hold cubic units, leaving ; small crates supply . Type and both totals. Desmos plots the point in the overlap and prints cubic units and minutes. Both limits hold, and every greater whole-number has been ruled out. The greatest possible number of large crates is . Choice C.