Question 105·Hard·Linear Inequalities in One or Two Variables
During an 8-hour manufacturing shift (480 minutes), a machine makes two kinds of parts, type A and type B. Producing one part of type A keeps the machine running for 6 minutes, and producing one part of type B keeps it running for 9 minutes.
Let be the number of type A parts and be the number of type B parts produced in a shift.
• Because the machine cannot run for more than the length of the shift, .
• Because at least 40 parts must be produced, .
What is the greatest possible value of ?
(Express the answer as an integer)
For SAT problems that ask for the maximum or minimum value of one variable under linear inequality constraints, first rewrite one inequality to express the target variable (here, ) in terms of the others. Notice how that expression changes as the other variable(s) increase or decrease, and choose extreme values (like the smallest possible ) that still satisfy the constraints to push your target variable as far as possible. Finally, remember that counts of objects must be whole numbers and often check corner (boundary) points of the feasible region rather than trying random values.
Hints
Focus on what you are maximizing
You are asked for the greatest possible value of (type B parts). Look at the inequalities and think about which variable you should try to make as small as possible to allow to be as large as possible.
Rewrite the time inequality in terms of
Take and solve it for . Once is written in terms of , think about what happens to the maximum allowed when gets larger or smaller.
Check the smallest possible
Since larger will reduce how big can be, try using the smallest that still satisfies and . Substitute that into the inequalities to find the allowed range for , then remember that must be a whole number.
Desmos Guide
Graph the inequalities
In Desmos, enter the two inequalities:
6x + 9y <= 480x + y >= 40
Also, because and are numbers of parts, add x >= 0 and y >= 0. You should see a shaded feasible region where all these conditions overlap.
See how depends on from the time limit
Add the boundary line of the time inequality by entering y = (480 - 6x)/9. This line forms the upper edge of the feasible region in terms of ; points above it would use more than 480 minutes.
Find the highest possible in the feasible region
Add the line x = 0 to represent making only type B parts. Tap the intersection point of x = 0 and y = (480 - 6x)/9 to see its -coordinate. That value is the maximum continuous (not necessarily whole-number) allowed; the greatest whole-number you can actually produce is the largest integer less than or equal to that -value that still lies in the shaded region.
Step-by-step Explanation
Translate and understand the constraints
We are told:
- Each type A part takes 6 minutes, so minutes for parts.
- Each type B part takes 9 minutes, so minutes for parts.
- The machine runs at most 480 minutes, so
- At least 40 total parts must be made, so
Also, and represent numbers of parts, so they must be nonnegative whole numbers.
Express in terms of from the time limit
Start with the time inequality and solve for :
This tells us the maximum possible for any given .
Notice the term: as increases, the right-hand side gets smaller. That means increasing will decrease the maximum possible .
Choose the smallest possible to make as large as possible
Since increasing reduces how large can be, we want the smallest that still satisfies all conditions.
The smallest possible is (you cannot make a negative number of type A parts).
Check the part-count inequality when :
So is allowed as long as .
Now apply to the time inequality:
Combining both conditions for when gives a range:
Use the fact that must be a whole number
The machine cannot produce a fraction of a part, so must be an integer.
From the previous step, must satisfy , and . The greatest whole number less than or equal to is .
Therefore, the greatest possible value of is 53.