Question
Question: A company manufactures two types of toys A and B. A toy type of A requires 5 minutes for cutting and...
A company manufactures two types of toys A and B. A toy type of A requires 5 minutes for cutting and 10 minutes for assembling. A toy type of B requires 8 minutes for cutting and 8 minutes for assembling. There are 3 hours available for cutting and 4 hours for assembling the toy in a day. The profit is Rs. 50 each on a toy type of A and Rs.60 each on a toy of type B. How many toys of each type should the company manufacture in a day to maximize the profit? Use linear programming to find the solution.
Solution
We here need to find the number of toys of type A and B which maximize the profit every day. For this, we will first assume them to be x and y respectively and create an objective function which will give us the profit per day in terms of x and y. Then from the given conditions, we will form inequalities, which will act as constraints to this function. Then we will draw a graph of those inequalities and shade the region common to all. After doing that, we will note down the corner points of that region and check them one by one in our objective function. The coordinate of the point which will give the maximum value of the objective function will be our required point and will give us the value of x and y.
Complete step-by-step solution:
Here, we need to find the number of toys of type A and B so that the profit is maximum on each day.
For this, let us assume that the number of toys of type A is ‘x’ and that of type B is ‘y’.
Thus, we need to find the value of x and y.
Now, we have been given that profit on each type A toy, there is a profit of Rs.50. Thus, the total profit of x type A-toys will be:
50×x⇒50x
Similarly, we have been given that profit on each type B toy, there is a profit of Rs.60. Thus, the total profit of y type B toys will be:
60×y⇒60y
Thus, the total profit on both type A and type B toys will be:
50x+60y
We need to minimize it by linear programming and hence, it will be our objective function.
Thus, we can say that:
Z=50x+60y
Hence, we need to maximize Z.
Now, we have been given that it takes 5 minutes for cutting toys of type A and 8 minutes for cutting toys of type B.
Hence, the total time that will be taken for cutting x type A toys and y type B toys is given as:
5×x+8×y⇒5x+8y
Now, we also have been given that the total time available for cutting toys in a day is 3 hours which is equal to 60×3=180 minutes.
Thus, 180 will be the maximum value for the total time that will be taken for cutting x type A toys and y type B toys.
Thus, we can say that:
5x+8y≤180
Now, we also have been given that it takes 10 minutes for assembling toys of type A and 8 minutes for cutting toys of type B.
Hence, the total time that will be taken for assembling x type A toys and y type B toys is given as:
10×x+8×y⇒10x+8y
Now, we also have been given that the total time available for assembling toys in a day is 4 hours which is equal to 4×60=240.
Thus, 240 will be the maximum value for the total time that will be taken for assembling x type A toys and y type B toys.
Thus, we can say that:
10x+8y≤240
Now, since x and y are the number of type A and type B toys, their value will always be either greater than or equal to 0.
Thus, we can say that:
x≥0y≥0
Now, these inequalities obtained are the conditions, which will be applied to maximize Z. Thus, we can say that these 4 inequalities will be the constraints to our objective function Z.
Thus, we will draw a graph of these 4 inequalities and shade the region common to all of them and check the corner points of that region to see which of them maximize Z.
Now, the first constraint is given as:
5x+8y≤180
Thus, its corresponding equation will be:
5x+8y=180
Now, we will find two solutions to this equation.
Case-1: Let x= 0
Thus, putting x=0 in this equation we get:
5x+8y=180⇒5(0)+8y=180⇒8y=180⇒y=8180=245
Thus, the first solution to this equation is (0,245)
Case-2: let y=0
Thus, putting y=0 in this equation we get:
5x+8y=180⇒5x+8(0)=180⇒5x=180⇒x=5180=36
Thus, the second solution to this equation is (36,0).
Hence, the two solutions to this equation are (0,245) and (36,0).
Now, to see which side of this line is the required region, we will put (0,0) in this inequality and if it turns out to be correct, the side on which this point lies will be the required region otherwise it will be the other side.
Thus, putting (0,0) in this inequality we get:
5x+8y≤180⇒5(0)+8(0)≤180⇒0+0≤180⇒0≤180
This inequality is correct, hence the side at which this point lies is the required side.
Now, the second constraint is given as:
10x+8y≤240
Hence, its corresponding equation will be:
10x+8y=240
Now, we will find two solutions to it.
Case-1: let x=0
Thus, putting x=0 into this equation we get:
10x+8y=240⇒10(0)+8y=240⇒8y=240⇒y=8240=30
Thus, the first solution to this equation is (0,30) .
Case-2: let y=0
Thus, putting y=0 into this equation we get:
10x+8y=240⇒10x+8(0)=240⇒10x=240
⇒x=10240=24
Thus, the second solution to this equation will be (24,0).
Hence, the two solutions to this equation are (0,30) and (24,0).
Now, as we checked above, we will check (0,0) in this constraint too to find which side of the line is the required side.
Thus, putting (0,0) in this inequality we get:
10x+8y≤24010(0)+8(0)≤2400+0≤2400≤240
This inequality is correct. Hence, the side of the line on which (0,0) will lie will be the required side.
Now, the next two constraints are:
x≥0y≥0
Now, we know that these two inequalities represent the first quadrant.
Hence, from all these observations, we get the graph as:
Now, we can see from the graph that these two lines intersect at a point which will also be one of the corner points.
We can find that point of intersection using the elimination method for the equations of these two inequalities.
Using the elimination method in the equations 5x+8y=180 and 10x+8y=240 we get:
10x+8y=240−(5x+8y=180) 5x=60
Solving this, we will get:
5x=60⇒x=560=12
Now, by putting this value of x in any of these equations we will get the required value of y.
Hence, putting x=12 in the equation 10x+8y=240we get:
10x+8y=240⇒10(12)+8y=240⇒120+8y=240⇒8y=120⇒y=8120=15
Hence, the required point is (12,15).
Thus, our graph will be:
Now, we can see from the graph that the corner points of the shaded region are (0,0), (24,0), (12,15) and (0,245) .
Now, we will put these points one by one in Z and see which of them will maximize Z.
Now, putting (0,0) in Z we get: