Part 2 - Nonstandard Minimization Problem with a Surplus Variable

This video is part 2 of a problem working with a non standard minimization problem with a surplus variable.

[@rwinkel54]

Thank you. I couldn't understand anything in my text book. You are giving me a clear example.

[@Ender7j]

This was a GREAT example of this kind of problem. It covered any 'nonstandard' situation I could think of and did so very clearly. Thank you very much, your work is STILL helping people!

[@mateakoscak]

thank you so much for help! finally I can understand how to pivot columns and how to find pivot element.

[@TheBluewater101]

im very grateful that i learned something from your video. Great thanks! kudos.

[@TheCoreh]

Thanks for the help, I wasn't totally getting this right by following my text book.

[@mohammedsalah5416]

I love this man

[@legend7890]

followed all the steps and finally, I was able to solve it. Thank you

[@JDLupus]

Thank you!! I would just like to check one thing (I think it's true already) but when we're checking for feasability, are we looking for as many unit columns as there are slack variables plus Z, so (2+1) in this case?

[@66Narendra99]

Good video! A minor error : At 1:16 it is the largest negative entry.. not the largest non-negative entry. Good Explanation though. You're a life safer!! Cheers..

[@kishanpatel3724]

Is this the same as the bigM method ?

[@vishalGoelmrwebsiter]

which method did he use, is it BIG M ??

[@AnaSwindall]

May God bless you, man.

[@ShahrukhKhan-ow3vq]

Thank u for the help

[@ShahrukhKhan-ow3vq]

Thank u for the help