Question 125·Medium·Linear Inequalities in One or Two Variables
A bakery ships only small boxes and large boxes of cookies. A small box contains 18 cookies, and a large box contains 30 cookies. For a certain order, the bakery must ship at least 12 boxes in total, and the total number of cookies can be at most 300.
What is the maximum number of large boxes that can be included in this order?
For linear-inequality word problems with two quantities, first define clear variables and translate each condition into an inequality. If you are asked to maximize or minimize one variable, look for a way to express the other variable in terms of it (often by using an "at least" or total-count condition) to reduce the system to one variable. Then solve that inequality carefully, and remember counts must be integers—choose the largest or smallest integer that satisfies all constraints and verify it in the original conditions.
Hints
Set up variables
Let one variable represent the number of small boxes and another represent the number of large boxes. What should each variable stand for?
Translate words into inequalities
Turn the phrases "at least 12 boxes" and "at most 300 cookies" into inequalities using your variables. You should get one inequality for boxes and one for cookies.
Reduce to one variable
To maximize the number of large boxes, would you want extra small boxes beyond the minimum required? Use the box inequality to express the number of small boxes in terms of the number of large boxes.
Solve and choose the maximum integer
After substituting, you should get an inequality involving only the number of large boxes. Solve it, then pick the largest whole number that satisfies it.
Desmos Guide
Create an expression for cookies in terms of large boxes
In Desmos, type y = 216 + 12x. Here, represents the number of large boxes, and is the total number of cookies when you use the minimum number of small boxes (so that ).
Use the cookie limit to find the boundary
Type another line: y = 300. This is the maximum allowed number of cookies. Look at where the line meets or crosses , and note the -value of that intersection.
Choose the largest integer that works
From the graph or by tracing along y = 216 + 12x, find the largest integer for which is still at or below 300. That integer is the maximum number of large boxes that can be shipped.
Step-by-step Explanation
Define variables and write the inequalities
Let
- = number of small boxes
- = number of large boxes
Translate the conditions into inequalities:
- At least 12 boxes total:
- At most 300 cookies:
We want to maximize (the number of large boxes).
Use the minimum number of small boxes
For a given number of large boxes , adding more small boxes only increases the number of cookies. That makes it harder to stay at or below 300 cookies.
So to allow as many large boxes as possible, we should use the fewest small boxes that still satisfy the box requirement.
The requirement is . To minimize cookies for a given , take exactly 12 boxes:
So
Substitute and form an inequality in one variable
Substitute into the cookie inequality :
Simplify step by step:
- Distribute 18:
- Combine with :
So the inequality becomes
Solve the inequality and interpret the result
Solve :
So cannot be more than 7. Since must be a whole number of boxes and we want the maximum possible number of large boxes, the answer is 7 large boxes.