Question 78·Hard·Linear Inequalities in One or Two Variables
A charity prepares two kinds of food boxes for a community event.
- Each vegetarian box costs $12 to assemble and weighs 4 pounds.
- Each meat box costs $17 to assemble and weighs 5 pounds.
The charity
- has a budget of $3,200,
- can transport no more than 900 pounds, and
- must prepare at least 150 total boxes in all.
What is the maximum number of meat boxes the charity can prepare while meeting all three requirements?
(Express the answer as an integer)
For inequality word problems that ask for a maximum or minimum number of items, first assign variables and turn each condition (cost, weight, totals, etc.) into an inequality. Then, focus on the constraint that most directly limits the quantity you are maximizing—often a resource limit like total weight or budget—and use it to get a simple upper (or lower) bound by dividing the total resource by how much each item uses. Finally, test that bound in the other inequalities to see if it is feasible; if it is, that bound is your maximum (or minimum), and you can avoid doing full linear-programming graphs or testing many random combinations.
Hints
Translate the situation into variables and inequalities
Let be the number of vegetarian boxes and be the number of meat boxes. Write one inequality for the budget, one for the weight limit, and one for the minimum total number of boxes.
Focus on the weight constraint
Using the inequality for weight, , and knowing that , think about how large can be, even in the most extreme case where you minimize or eliminate vegetarian boxes.
Test the extreme case for meat boxes
Once you find an upper bound on from the weight constraint, try choosing (all meat boxes) with that value of and check whether the budget and the minimum of total boxes are still satisfied.
Remember you are maximizing meat boxes, not total boxes
Make sure you are choosing values of and that increase the number of meat boxes, even if that means having fewer vegetarian boxes, as long as all inequalities are satisfied.
Desmos Guide
Use Desmos to find the weight-based limit on meat boxes
In an expression line, type 900/5 and look at the numerical result. This is how many meat boxes you could have if all boxes were meat and you used exactly the pounds of weight.
Compare with the budget-based limit
In a second expression line, type 3200/17 and compare this value with the result from 900/5. The smaller of these two values is the stricter upper limit on how many meat boxes you can afford while either all boxes are meat or the budget is the only constraint.
Confirm other constraints for that candidate
Use the smaller value from Step 2 as a candidate for the number of meat boxes. In a new expression line, multiply it by 17 to check that the cost is at most 3200, and compare it to 150 to verify it meets the minimum total boxes requirement. The candidate value that satisfies all these checks is the maximum possible number of meat boxes.
Step-by-step Explanation
Define variables and write inequalities
Let be the number of vegetarian boxes and be the number of meat boxes.
Use the information to write inequalities:
- Budget: each vegetarian box costs dollars and each meat box costs dollars, with a total budget of dollars:
- Weight: each vegetarian box weighs pounds and each meat box weighs pounds, with a maximum of pounds:
- Minimum total boxes: at least boxes in total:
- Also, and (you cannot make a negative number of boxes).
We want to maximize while satisfying all these inequalities.
Use the weight limit to find an upper bound for meat boxes
The key inequality that directly limits how many meat boxes you can have is the weight constraint:
Because , we know . That means is at least :
So it must be true that
Divide both sides by to get an upper bound on :
So, no matter how many vegetarian boxes are made, the number of meat boxes cannot be larger than .
Check that this bound on meat boxes is actually attainable
Now we need to see whether we can actually reach without breaking the other conditions.
The easiest way to maximize meat boxes is to make no vegetarian boxes, so let .
- Weight with :
Setting gives , which exactly uses the full weight limit.
- Budget with and :
This is within the dollar budget, since .
- Minimum total boxes with and :
Check that this is at least :
So the minimum of boxes is satisfied.
Thus meat boxes is feasible: it meets the weight limit, the budget, and the minimum number of boxes.
Conclude the maximum number of meat boxes
From Step 2, cannot be greater than , and from Step 3 we found that is actually possible while satisfying all constraints.
Compute this value:
Therefore, the maximum number of meat boxes the charity can prepare is .