The values of x₁, x₂, and x₃ that maximize the total profit are the solution to the linear programming model that helps to achieve maximum profitability while considering resource constraints.
The objective is to maximize the total profit, which can be represented as total Profit (P) = Profit from Product 1 + Profit from Product 2 + Profit from Product 3
Profit from Product 1:
For the first 15 units of Product 1, the profit per unit is $360, and for any additional units, it's $30. So, the profit from Product 1 can be calculated as:
Profit₁ = 360x₁ (for x₁ ≤ 15)
Profit₁ = 360 * 15 + 30(x₁ - 15) (for x₁ > 15)
Profit from Product 2:
For the first 20 units of Product 2, the profit per unit is $240, for the next 20 units, it's $120, and for any additional units, it's $90. So, the profit from Product 2 can be calculated as:
Profit₂ = 240x₂ (for x₂ ≤ 20)
Profit₂ = 240 * 20 + 120(x₂ - 20) (for x₂ > 20)
Profit from Product 3:
For the first 10 units of Product 3, the profit per unit is $450, for the next 5 units, it's $300, and for any additional units, it's $180. So, the profit from Product 3 can be calculated as:
Profit₃ = 450x₃ (for x₃ ≤ 10)
Profit₃ = 450 * 10 + 300(x₃ - 10) (for x₃ > 10)
Constraints:
- Resource constraint: x₁ + x₂ + x₃ ≤ 60
- Resource constraint: 3x₁ + 2x₂ ≤ 200
- Resource constraint: x₁ + 2x₃ ≤ 70.