Thank you so very much. Straight on point, elaborate and easy to understand. Our professor made a million mistakes in the 1 or 2 incomplete examples he tried to explain and it was so messy, even he was unsure and said that we should look at it at home and come back with questions, if we had any. This video has been a delight.
Artificial variables are introduced in order to find a feasible basic solution that we can start phase-2 with in order to find the optimal basic solution
In order to get proper temporarily obj. function at step 0 you can just sum up all the rows with artificial variables, revert the sign and place it in z row with artificial columns in that row set to 0.
If it's a minimisation problem as opposed to a maximisation problem, are the auxilliary variables then maximised? Or are they always going to be minimised no matter what? Thanks
The purpose of the auxiliary problem is to find a feasible solution of the original problem. For this purpose, we minimize the sum of artificial variables, regardless of the objective of the original problem.
I HATE COMPUTER SCIENCE
this is the easiest shit ever wum
@@amellia8450 must be nice
@@amellia8450😂😂😂
😂😂
😂😂😂
Thank you so very much. Straight on point, elaborate and easy to understand. Our professor made a million mistakes in the 1 or 2 incomplete examples he tried to explain and it was so messy, even he was unsure and said that we should look at it at home and come back with questions, if we had any. This video has been a delight.
"use them and lose them right?" 21:28
gigachad teacher
This is rlly perfect thank u so much it's loud and clear👌
Didnt know gru knew the two phase simplex method
LMFAOOOOOOOOOO IM DEAD
As a bona fide student of CBU
I'm please to say that you're just the best😁😁
Absolute waste of time would not recommend
do you explain why we need the 2-phase method for this problem? I guess because we have artificial variables.
Artificial variables are introduced in order to find a feasible basic solution that we can start phase-2 with in order to find the optimal basic solution
Excellent, straightforward explanation. Thank you.
In order to get proper temporarily obj. function at step 0 you can just sum up all the rows with artificial variables, revert the sign and place it in z row with artificial columns in that row set to 0.
Amazing work, thank you.
Hey. Great video! I have one question regarding completing phase 1, does objective needs to be 0 in order to proceed to the next phase?
Yes!
tedious work hats off
12:06 x1 chosed as entering column because its the only one that has negative coefficient, what if there is 2 column that has 2 negative coefficient?
Thank you 😊
Epic
Thank You Sir 😊😊😊
Thanks so much for sharing in very clear and understandable way.
that's the best simplex explaination i've ever seen, this will help me a lot thank you!!!
Thanks a lot! I spent nearly 2 hours to find out the answer and you just saved my life
amazing!
Your work is very much appreciated sir.
I love how you explain,thank you for the video 👌
FYI , mistake in big M video, final z value 36. But this isignificant, reat correct
Thank you for this informative content
what can you say, when you actually find a bounded solution ? Is it the same kind of answer as if it was a regular simplex method ?
Yes
If it's a minimisation problem as opposed to a maximisation problem, are the auxilliary variables then maximised? Or are they always going to be minimised no matter what? Thanks
The purpose of the auxiliary problem is to find a feasible solution of the original problem. For this purpose, we minimize the sum of artificial variables, regardless of the objective of the original problem.
Thank you Sergiy! Exam is tomorrow. Wish me luck!
🤞
Perfect, clean explanation
I believe you can mix step 1 and step 2. I've never seen anyone separate step 1 and 2 like that.
thanks mr sergiy, i'm pass my exam today😄😄😄
Great, congratulations!
thanks a lot, it was very helpful
what would be the new problem if i only had a3 for example. would it be min a3?
Yes.
@@sergiybutenko thanks!
hi
thank you