we introduced them to be able to solve it with SIMPLEX. They should be zero if we want a real-world answer. Another way you can look at it is this: You extend the feasible region to include the (0,0) region up to it (so you can use simplex), then you minimize artificial variables first to get out of that zone and get to the real feasible zone. Then stage 2 starts and you can move around the corners to find the best solution.
is it possible to have a value of 0 for the I row but still have negative values? if so would you just continue until there are no more negative values in the I row ?
Yes, it is possible. Once the I row has a value of 0, we have a basic feasible solution, remove the I row, and the artificial variable columns, then move into the second stage.
this vid is outstandingly easy to follow and comprehend huge thanks !! Question which text book follow this methodology ?? as I've been following along with professor Hamdy Taha's Book of OP Research Thanks Again :) .
So if "I" equals the negative sum of artificial values, if there is one artificial value will "I" equal -(a1) ? and if there is three artificial values will I = -(a1 + a2 + a3) ?
@@ratofalady8125 No, that is not the case. You will have to use the standard methods for dealing with a maximising and minimising problem and combine that with I. If you are unsure about how to approach maximising, please watch my video which has both maximising and minimising. ua-cam.com/video/t0NkCDigq88/v-deo.html
my brain when simplex
Checking the vertices of the convex octagon I see. You’re catching on!
this video is the best... thank you so much for saving my grade!!!
Great demonstration
Thank you!
Tableau? More like tabl-oh yeah, because this video was awesome; thanks for posting it!
Ha ha. Thanks for the great comment! I'm glad it was useful to you.
@@mathshelpwithmrorys8555 You are most welcome, and I can keep those kinds of comments up if you'd be interested...
I don't get it, can you explain?
@@daniniamut1362 No problem. "Tableau" is another term that's used to refer to the matrix of coefficients in the simplex method.
Your voice is amazing 💕 Can you also make a video about post optimality analysis??
Brilliant video, thanks :)
Man saved my exam
THANKS FOR THIS!!!
You're welcome. I'm glad it was helpful to you.
thank you
You're welcome.
Great explanation. Thank you :)
Thank you sir
Whats the purpose of minimising artificial variables? I dont understand the link between minimal artificial variables and a feasible solution
we introduced them to be able to solve it with SIMPLEX. They should be zero if we want a real-world answer.
Another way you can look at it is this:
You extend the feasible region to include the (0,0) region up to it (so you can use simplex), then you minimize artificial variables first to get out of that zone and get to the real feasible zone. Then stage 2 starts and you can move around the corners to find the best solution.
is it possible to have a value of 0 for the I row but still have negative values? if so would you just continue until there are no more negative values in the I row ?
Yes, it is possible. Once the I row has a value of 0, we have a basic feasible solution, remove the I row, and the artificial variable columns, then move into the second stage.
this vid is outstandingly easy to follow and comprehend huge thanks !! Question which text book follow this methodology ?? as I've been following along with professor Hamdy Taha's Book of OP Research
Thanks Again :) .
This is primarily focused for students who are taking A-level further Maths, it is present in the Edexcel Decision 1 textbook chapter 7
2:00 how is it possible for x and y to be 0, wouldn't that violate the constraint?
So if it was a maximise problem the we'd just work with P? No need to set it to something like with example
So if "I" equals the negative sum of artificial values, if there is one artificial value will "I" equal -(a1) ? and if there is three artificial values will I = -(a1 + a2 + a3) ?
Yes, absolutely!
Is I always being set up to be minimising so always -(a1 + a2)
Yes, exactly that.
@@mathshelpwithmrorys8555 so you can never be given a maximising problem that includes I ?
@@mathshelpwithmrorys8555 so you can never be given a maximising problem that includes I ?
@@ratofalady8125 No, that is not the case. You will have to use the standard methods for dealing with a maximising and minimising problem and combine that with I. If you are unsure about how to approach maximising, please watch my video which has both maximising and minimising. ua-cam.com/video/t0NkCDigq88/v-deo.html
how do you use I if it's for a maximisation question? Thank you
is it just I = (a1+a2) ?
It wasn’t clear how you picked the basic variables?
The columns with only1's and 0's are your basic variables
@@othusitsemolokele4659 for the basic var. column when constructing the first tableau 3:07