I wish I found your video earlier..... To other RUclips teachers: It doesn't matter if it's +1 or -1, minimum or maximum for artificial variables. Please don't say we HAVE TO keep it at a min/max. It's confusing. .... God bless you Lee and thank you very much !!!
So, if you cannot get an artificial variable out of the set of basic variables, then you are not feasible. We have only reached feasibility when we have pivoted out all artificial variables (all a.v.s set = 0). The way that the simplex algorithm works will always keep us feasible once we are feasible, but the purpose of phase 1 is to get us there. I hope that's what you are asking. Let me know if you have more questions.
Hi! At this time I don't have any videos already made for simplex or Big M, but I could make one next week if you'd like. (This week is kind of crazy for me).
@@leephillips9978 Hey sir, I guess you haven't made any video yet about Big M. Do you have any plan nowadays for that? Cuz' I finally understand it pretty well after few videos on yt, I'd like to watch/learn it from you :)
This is hands-down one of the best tutorials I have ever watched. Every step is shown and clear and easy to follow. Thank you so much!!
i really can't describe how happy i'm am to finally understand how it works , Thank you so much !!
I wish I found your video earlier..... To other RUclips teachers: It doesn't matter if it's +1 or -1, minimum or maximum for artificial variables. Please don't say we HAVE TO keep it at a min/max. It's confusing. .... God bless you Lee and thank you very much !!!
you're an actual lifesaver
can you provide the pdf file please!
Can you send that pdf of the worksheet you were working on during the video please?
Hello bro thank you so much your explainations are the best
Thanks, and I'm glad they are helpful!
Can you please tell me the cases that decide whether or not we have a feasable solution for phase 1?
So, if you cannot get an artificial variable out of the set of basic variables, then you are not feasible. We have only reached feasibility when we have pivoted out all artificial variables (all a.v.s set = 0). The way that the simplex algorithm works will always keep us feasible once we are feasible, but the purpose of phase 1 is to get us there. I hope that's what you are asking. Let me know if you have more questions.
thanks for your video, it help me a lots :33
I'm glad that you found it helpful!
Hi ! Do you make simplex method and Big M method video ?
Hi! At this time I don't have any videos already made for simplex or Big M, but I could make one next week if you'd like. (This week is kind of crazy for me).
@@leephillips9978 thank you so much
@@leephillips9978 Hey sir, I guess you haven't made any video yet about Big M. Do you have any plan nowadays for that? Cuz' I finally understand it pretty well after few videos on yt, I'd like to watch/learn it from you :)