Lec-13 Transportation Problems
Top Comments
All Comments (81)
-
fabuluous ... sir u really helped me a lot.. can anyone please provide me the link for operations and production mgt topic
-
Because of prof . g srinivasan, i could pass my mba exam, for which i was strugging for many years. I really want to thank him. god bless him..........
-
Dear Sir,
As explained in this lecture we are exhausting either one of the source or one of the destination at each allocation. Hence, there will be at most m+n-1 allocations. (There can be less than m+n-1 since a single allocation can exhaust both of them if they have same capacity). I totally agree with this.
But, at 49:58, you said that these three methods also won't generate a loop. How???
Allocations can obviously form loop even if number of allocations is less than m+n-1. Please explain.
-
very very useful lecture thanks a lot for upload ....... insha allah it will help me in exams...
-
excellent explanation!!! thank you so much...soo dont feel the loss of missing classes!!! thank you!
-
Great Sir.thank u :-)
-
awsome professor -:)
-
awesome professor
-
Wonderful , Indian Professor
-
prff.G.Srinivasan is the gift of God to the Students community.Excelent!
Great Explanation Sir. The way you repeat it is really useful for my slow mind :-) Thank you.
qr3ca 1 year ago 19
Very good explication. I prefer clasical methods with board and eraser that a laptop with diapositives.
af9rodc 10 months ago 7