A company makes square boxes (2 minutes to make, profit of K4) and triangular boxes (3 minutes to make, profit of K5). The client wants at least 25 boxes total, with at least 5 of each type. The company has one hour (60 minutes) to make the boxes. We need to find the combination of square and triangular boxes that maximizes profit.
2025/5/27
1. Problem Description
A company makes square boxes (2 minutes to make, profit of K4) and triangular boxes (3 minutes to make, profit of K5). The client wants at least 25 boxes total, with at least 5 of each type. The company has one hour (60 minutes) to make the boxes. We need to find the combination of square and triangular boxes that maximizes profit.
2. Solution Steps
Let be the number of square boxes and be the number of triangular boxes.
The objective function to maximize is the profit:
The constraints are:
(at least 25 boxes)
(at least 5 square boxes)
(at least 5 triangular boxes)
(60 minutes available)
and are non-negative integers.
We want to find integer values of and that satisfy all constraints and maximize .
First, consider the constraint .
If , then , which means , so . Since must be an integer and , we have .
We also have , so , which implies . But we know , so is not possible.
Let's consider values of x that give integer solutions.
Case 1: . Then . Substitute into :
Since , we have . Also, , so , meaning .
So . We want to maximize .
To maximize , we take the largest possible value for , which is
1
0. If $y = 10$, then $x = 25 - 10 = 15$.
Check the constraints: , , , .
The profit is .
Case 2: . Then , so .
For to be an integer, must be even. Since , we must have .
implies , so , meaning .
implies , so , meaning .
Combining these, since must be even, we have .
If , then . , .
If , then . , .
If , then . , .
Now we need to find other possible combinations where and .
If , then , so this has no integer solutions for since must be even.
If , , then . So , . Then profit .
If , then needs to be integer so must be even, which means must be odd.
Possible profits:
x=21, y=6, P =
1
1
4. x=20, y=7, $2(20)+3(7) = 40+21 = 61$, impossible.
x=18, y=8, P=
1
1
2.
So the maximum profit is 114, when and .
3. Final Answer
The best combination is 21 square boxes and 6 triangular boxes, which yields a profit of K
1
1
4.