Step-by-step explanation:
Let's define the decision variables:
Let x be the number of production runs using the old process.
Let y be the number of production runs using the new process.
The objective is to maximize the revenue, which is given by:
Revenue = 4000 * (24x + 20y) + 6000 * (20x + 28y)
Subject to the following constraints:
1. Coal A constraint: 20x + 12y <= 2000 (available units of coal A)
2. Coal B constraint: 28x + 36y <= 2500 (available units of coal B)
3. Coal C constraint: 8x + 16y <= 1500 (available units of coal C)
4. X production constraint: 24x + 20y >= 1800 (required units of X)
5. Y production constraint: 20x + 28y >= 1600 (required units of Y)
6. Non-negativity constraint: x >= 0, y >= 0
Thus, the linear programming model can be formulated as follows:
Maximize:
Z = 4000(24x + 20y) + 6000(20x + 28y)
Subject to:
20x + 12y <= 2000
28x + 36y <= 2500
8x + 16y <= 1500
24x + 20y >= 1800
20x + 28y >= 1600
x >= 0, y >= 0
This model can be solved using various linear programming techniques to find the optimal values of x and y that maximize the revenue for the required production.