To minimize the cost while meeting the given conditions, we can set up a linear programming problem. Let's define the variables:
Let x be the number of type A printers ordered.
Let y be the number of type B printers ordered.
The cost, C, can be calculated as follows:
C = (cost of type A printer * number of type A printers) + (cost of type B printer * number of type B printers)
C = (237 * x) + (122 * y)
The profit, P, can be calculated as follows:
P = (profit per type A printer * number of type A printers) + (profit per type B printer * number of type B printers)
P = (22 * x) + (19 * y)
Now, let's consider the given constraints:
1) We can order no more than 120 printers this month:
x + y ≤ 120
2) We need to make at least $2,400 profit on the printers:
P ≥ 2400
(22 * x) + (19 * y) ≥ 2400
3) We must order at least one of each type of printer:
x ≥ 1
y ≥ 1
To minimize the cost, we need to minimize the objective function C= (237 * x) + (122 * y) subject to the given constraints.
Using linear programming techniques, we find that the solution is:
69 of type A : 51 of type B
Therefore, you should order 69 type A printers and 51 type B printers to minimize your cost while meeting the given conditions.
Your computer-supply store sells two types of inkjet printers. The first, type A, costs $237 and you make a $22 profit on each one. The second, type B, costs $122 and you make a $19 profit on each one. You can order no more than 120 printers this month, and you need to make at least $2,400 profit on them. If you must order at least one of each type of printer, how many of each type of printer should you order if you want to minimize your cost? Possible answers:
69 of type A : 51 of type B
40 of type A : 80 of type B
51 of type A : 69 of type B
80 of type A : 40 of type B
1 answer