compound | amount in 1 bag of A |
amount in 1 bag of B |
total amount available |
chicken | 1 | 2 | 12 |
fish | 3 | 2 | 24 |
Let x = # of bags of product A and y = # of bags of product B Then the total profit is P = 10x + 12y.From the table the total amount of chicken used is x + 2y. Since there are only 12 lbs available we obtain the constraint x + 2y <= 12. Similarly, with the fish we obtain the constraint 3x + 2y <= 24. Summarizing, we obtain the following linear programming problem
Maximize P = 10x + 12y subject to the constraints æ x + 2y £ 12 ö ç 3x + 2y £ 24 ÷ ç x ³ 0 ÷ è y ³ 0 ø |
(1) Set up the following linear programming problem. A company manufactures two products A and B on two machines I and II. The company makes a profit of $3 per item on each unit of product A and a profit of $4 per item on each item of product B. The time constraints for dthe machines are summarized in the following table. Determine the number of units of each product that should be produced to maximize profit.
machine | time to produce 1 unit of product A |
time to produce 1 unit of product B |
total time available |
I | 6 min | 9 min | 5 hrs |
II | 5 min | 4 min | 3 hrs |
| Table of Contents | | Previous | | Next |