00:01
Hello everyone, let us look into the question.
00:04
Here we are given z that is maximize z equal to 2x1 plus 5x2 subject to the constraints 6x1 plus 5x2 less than or equal to 60 then 2x1 plus 3x2 less than or equal to 20 and 3x1 plus 6x2 less than or equal to 48.
00:31
So, first we have to make this equalities as equation.
00:35
So, we will get 6x1 plus 5x2 equal to 60 mark it as equation 1 then 2x1 plus 3x2 equal to 20 mark it as 2 and 3x1 plus 6x2 equal to 48 mark it as equation 3.
00:53
So, now from the equations 1 we can have x and y values.
01:06
So, take x and y.
01:07
So, if x is that is x1 y1 x2.
01:10
So, if we take x1 equal to 0 then x2 will be 12 suppose if we take x2 equal to 0 then x1 will be 10 then for the second equation similarly we can find the values of x1 and x2 that is we can find the set of values.
01:28
So, take x1 equal to 0.
01:31
So, x2 will be 24.
01:47
So, 8 suppose if we take x2 as 0 then x1 will be 12 and come to the third question.
01:54
So, here consider the values x1 and x2.
01:58
So, if we take x1 as 0 then x2 equal to 8 suppose if we take x2 as 0 then this is 16 now for this values we have to plot the graph.
02:11
So, now draw the line which is x1 axis and this is x2 axis then we have to plot all the values and we have to find the solution region that is otherwise we can call it as feasible region.
02:37
So, the first equation the points are 0 12 10 0...