00:01
Hello, here we have to solve the given problem by the simplex method.
00:04
We have to maximize the z.
00:07
We will be introducing the slack variable.
00:10
So maximize z to x1 -x2 plus x3 plus 0 is 1 plus 0 is 2 plus 0 is 3.
00:22
This one is subjected to x1 -x2 plus 3x3 plus s1 equals to 4.
00:37
2x1 plus x2 plus s2 equals to 10.
00:44
X1 minus x2 minus x3 plus s3 equals to 7.
00:53
And x1, x2, x3, s1, s2 and s3, they are greater than equal to 0.
01:03
Now we will be starting with the iteration.
01:06
So starting with the iteration, we get.
01:20
Hello, so here observe the first iteration.
01:24
As we have to maximize the value of z, we are more focused that the value of zj minus cj obtained is greater than or equal to 0...