Let's start by defining the variables we will use:
- Let's say the number of worker A is "a".
- Let's say the number of worker B is "b".
We want to maximize the total yield contribution subject to the constraints given:
- Total work time combined can't exceed more than 1400 minutes: 5a + 60b <= 1400
- We only have $900 in hand so we cannot exceed that limit either: 5a + 18b <= 900
Our objective function is the total yield contribution, which we want to maximize:
- Total yield contribution = 0.0027a + 0.0175b
We can use linear programming to solve this problem. The first step is to convert the problem into standard form by introducing slack variables:
- 5a + 60b + s1 = 1400
- 5a + 18b + s2 = 900
We can then express the objective function in terms of these variables:
- Total yield contribution = 0.0027a + 0.0175b + 0s1 + 0s2
We can use a linear programming solver to solve this problem. The optimal solution is:
- a = 100
- b = 16
- Total yield contribution = 0.27 + 0.28 = 0.55
Therefore, we need 100 worker A and 16 worker B to get the best total yield contribution we can get, which is 0.55.