Solve the linear programming problem.
1 answer:
Answer:
1. Objective function is a maximum at (16,0), Z = 4x+4y = 4(16) + 4(0) = 64
2. Objective function is at a maximum at (5,3), Z=3x+2y=3(5)+2(3)=21
Step-by-step explanation:
1. Maximize: P = 4x +4y
Subject to: 2x + y ≤ 20
x + 2y ≤ 16
x, y ≥ 0
Plot the constraints and the objective function Z, or P=4x+4y)
Push the objective function to the limit permitted by the feasible region to find the maximum.
Answer: Objective function is a maximum at (16,0),
Z = 4x+4y = 4(16) + 4(0) = 64
2. Maximize P = 3x + 2y
Subject to x + y ≤ 8
2x + y ≤ 13
x ≥ 0, y ≥ 0
Plot the constraints and the objective function Z, or P=3x+2y.
Push the objective function to the limit in the increase + direction permitted by the feasible region to find the maximum intersection.
Answer: Objective function is at a maximum at (5,3),
Z = 3x+2y = 3(5)+2(3) = 21
You might be interested in
Answer:
There are 795 combinations.
Step-by-step explanation:
The number of ways or combinations in which we can select k element from a group of n elements is given by:
So, if Miriam want to choose 3 movies with at least two comedies, she have two options: Choose 2 comedies and 1 foreign film or choose 3 comedies.
Then, the number of combinations for every case are:
1. Choose 2 Comedies from the 10 and choose 1 foreign film from 15. This is calculated as:
2. Choose 3 Comedies from the 10. This is calculated as:
Therefore, there are 795 combinations and it is calculated as:
675 + 120 = 795