A factory manufactures three products, A, B, and C. Each product requires the use of two machines, Machine I and Machine II. The total hours available, respectively, on Machine I and Machine II per month are 6,320 and 6,280. The time requirements and profit per unit for each product are listed below.
| | A | B | C |
|---|---|---|---|
| Machine I | 6 | 8 | 10 |
| Machine II | 6 | 6 | 12 |
| Profit | $8 | $13 | $16 |
How many units of each product should be manufactured to maximize profit, and what is the maximum profit?
Start by setting up the linear programming problem, with A, B, and C representing the number of units of each product that are produced.
Maximize P =
subject to:
≤ 6,320
≤ 6,280
Enter the solution below. If needed round numbers of items to 1 decimal place and profit to 2 decimal places.
The maximum profit is $ when the company produces:
units of product A
units of product B
units of product C