00:01
So let us start with the concept which we are going to use here for this question.
00:07
So by using the simplex method, we have to minimize the function that is minimum of z is equals to 3x1 plus x2 plus 4x3 subjected to a 3x1 plus 2x2 plus 4x3 less than equals to 12, 2x1 plus 3x2 plus 3x3 greater than equals to 6, x1 plus 3x2 plus 5x3 greater than equals to 8 and x1 greater than to 0, x2 greater than equals to 0 and x3 greater than equals to 0.
00:52
This means this all three should to be positive.
00:57
So by using the simplex method, let us have a look to the solution.
01:00
So first of all, we have to minimize this subject to the given constraints, right? so first of all, let us say the maximization of z, okay, we will go the reverse of it.
01:13
So maximization of z will be equals to minus of 3x1 minus of x2 minus of 4x3.
01:20
So the problem is converted to canonical form by adding the slack, surplus and artificial variables as appropriate.
01:32
So as you can see in the first, the constraints, constraint first is type of what? less than equals to.
01:45
So we should add the slack variable s1...