Operations Research 07D: Assignment Problem & Hungarian Method

[@YongWang]

Hi Guys, please comment and let me know what you think about this Operations Research Open Course. Your feedback is really appreciated. If you enjoy the video, please subscribe and share. All my replies here are only related to the content in my own videos. I am afraid I won't be able to answer other questions. Thanks for your understanding.

[@YongWang]

Correction: At 1:05, the objective function should be: x11, x12, x13, x14 in the first row; x21, x22, x23, x24 in the second row; x31, x32, x33, x34 in the third row; and x41, x42, x43, x44 in the fourth row.

[@bocao3491]

Thanks for the correction! That was something I wanted to ask before seeing this comment.

[@tharinda]

Thanks for the clarification. 🙏

[@alexandergalligan7695]

How people figured this out will always amaze me.

Great teaching professor Wang. Thank you for uploading!

[@YongWang]

Thanks for the comment, Gorkem.

[@周瑋潔-h1y]

Thank you so much for the well done video!! It’s so clear and straightforward with precise instructions!

[@mividamiii]

Yong Wang abi mükemmel bi insansın çok teşekkür ettim öpüyorum canım

[@tharinda]

At 2:52, the selected cell supposed to be the first one of the second row as the method is Least Cost yeah? 🤔

[@nikoo2]

if u read ur textbook without an example its real black magic that is written down on those pages, but with an example its very easy to understand!

[@jsl258]

2:42 I think you should put the general formulation of the assignment problem here(where the sum of each constraints is equal to 1), instead of explaining that it is a special case of a Transportation problem by showing the transportation problem formulation. It could be confusing. But other than that, GREAT videos!

[@YongWang]

thanks for the comment, jin soo

[@lillianlu8616]

Hi, thank you for the video! It's very helpful. Just wondering, if there is a 5th city added to the table, number of employees remains the same. Some of the employees can go to two cities. All cities must be assigned. How do we solve it? Thanks

[@soupe2000]

That's.... AMAZING!!! Thank you so much, you saved my exams!

[@mdnabi3888]

You have explained so well. But when I am solving another problem. I am not getting the answer. Have solved 5 by 5 or 6 by 6 matrix. If yes please send the link to me

[@berilyazar8734]

What was m representing in 5.58?

[@denissmolin9413]

Brilliant video!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

[@alanoodm3549]

where we can find these slides ... thanks alot

[@hadilacounty6700]

Why z=15 ????????

[@zdarovakoresh]

The optimal solution is 12, when x12=1, x21=1, x33=1, x41=1.

[@omercix]

Thank you

[@lschan9242]

i think you minimization function is wrong , it should not be x11 x12 x13 x14 all the time right ? need to depend on the i and j of the row n column

[@lschan9242]

** obj function

[@YongWang]

lindsey96, Yes, you are right. Thanks for pointing out this error.

[@zdarovakoresh]

Your lectures are great, but there is a mistake somewhere. The optimal solution is 12, when x12=1, x21=1, x33=1, x41=1.

[@maximillianyanez6937]

I can't see where the mistake was