Problem-on-Linear-Programming
Problem-on-Linear-Programming
Constraints:
The feasible region is the area bounded by these lines. Corner Points:
1. (25, 40)
2. (25, 125)
3. (75, 75)
4. (125, 25)
Optimal Solution: The maximum profit occurs at the corner point (25,
125) with a profit of P331,250. Therefore, the airline should sell:
25 first-class tickets
125 ordinary tickets
to maximize profits.
Problem 2
A poultry raiser plans to raise chicken, ducks and turkeys. He has room for
only 200 birds and wishes to limit the number of turkeys to a maximum of
25, the number of turkeys and ducks to a maximum of 100. His estimated
profit is P60, P50 and P240 on each chicken, duck and turkey respectively.
a. How many of each should he raise to maximize profit?
b. How much is the maximum profit?
x: Number of chickens
y: Number of ducks
z: Number of turkeys
Therefore:
A. The poultry raiser should raise 100 chickens, 75 ducks, and 25 turkeys to
maximize profit.
B. The maximum profit is P15,750.