Your video explanation is amazing, I’ve watched different videos on this topic and yet I didn’t get it, but with your video, you broke it down well. I was even able to work out a question of my own, thank you so much
After watching more than 10 youtube videos on 10 channels, this is the best i have ever found. I wish i got this channel before. Thank u so much mama you are really great.
I must say that your video is really very helpful for me. I was struggling to learn this chapter and now this chapter is just a matter of cake walk for me.
Your video is so helpful! Thanks a lot! Please try to make more videos related to operations research topic such as MODI method, Degeneracy etc and others.
Nice demonstration Please, could you confirm that after the first path is calculated, when no loop is possible , the optimization is obtained : example : factories= [8, 15, 21] projects= [8, 36] costs = [ [9, 16], [7, 13], [25, 1] ] 1st result [[ 8 0] [ 0 15] [ 0 21]] In this example as the first line and column( except 0,0) are made of of 0 , you cannot loop If you reverse the 2 columns of the cost matrix , and the projects list, you can make a first optimization loop , but you get the same configuration without a possible loop . 1st result [[ 8 0] [15 0] [13 8]]
Madam your presentation was very simple and nice , I had one doupt in final all are positive then why you choose for last matrix , is there any rule is there or we can choose any one positive matrix
Nice video. However,which criteria did you use to decide which matrix will give you the most optimal cost amongst the others since they were all positive?
Your video explanation is amazing, I’ve watched different videos on this topic and yet I didn’t get it, but with your video, you broke it down well. I was even able to work out a question of my own, thank you so much
After watching more than 10 youtube videos on 10 channels, this is the best i have ever found. I wish i got this channel before. Thank u so much mama you are really great.
Even a blind person can see through your working clearly.. you are the best😘
Very easy and simple explanation, finally I got the solution for finding optimal solution through this method.... Thank you dear mam....
You are, hands down, the best teacher I've ever had. Thanks for working so hard and providing this video in english. It helps me a lot mam 😍🥰
Thanks for such nice words and appreciation 😊
you deserve a super like for do it step by step and spend all that time and paper!!!
This is the most understandable video i have seen. Thank you very much 🥰🥰
Very very well explained....really the procedure is very clear now...I like the way you presented in crystal clear form 😍😍😍
Ma'am this is the best video I've watched on this topic. Thankyou for the crystal clear explanation.
I have some confusion in this method mam but you explained very clearly step by step mam Thank you so much mam 👏
I must say that your video is really very helpful for me. I was struggling to learn this chapter and now this chapter is just a matter of cake walk for me.
Thank you, well done
I would like to thank you for this video. This really helped me a lot in finishing our quiz. You have explained it well and I finally understood it.
superb video with proper explanation of each and every step
very properly explained and presented 😊😊😊😊😊
How beautifully presented and explained. You are one of the great teacher. Thank you mam ❤️😍❤️
Thank you so much for doing this video our professor didn't teach this to us but gave as an exercise so this video helps me a lot ♥️
thank you so much. Finally I got it now clearly.
thank you so much for this video. it helps a lot for my assignment..i learned from this video than my online class.
Thank you so much!! I finally understood our lesson!
Thank you so much for giving me a better understanding.
Absolutely mind blowing explained
Thank you so much ma'am for this useful video your teaching way is too good 💯
as a beginner, this gives me some foundation. thanks.
Very interesting love this . Now i can do my assignments nw
You have done a very good job. Thanks
Very useful video for me ❤❤, thanks for sharing this amazing content.
this is really helpful👍
Too much helpful. Thanks a lot
Great staff mum, keep it up
Thanks for sharing this. It helps me alot!
The content is very good. Moreover I love your way of teaching.
Thanks a lot 😊
I was struggling to learn this chapter from last two months. Now I find this chapter very interesting. Thanks mam.
Here there is a link for modified distribution method.
Thanqu soooo much mam wonderful explanation 🥰🥰plz make more veidos
Thanks 🙏
Was very helpful
very well explained video....it would really help many.
Wow good presentation
Thank you soo much. I really learned and understood this than our university lecture. very helpful for students like us. Keep it up.
you deverse the super like your explanation is wonderfull
Thank you! 😃
Very well explained. Thanks mam
Thanks a lot mam for your dedication
The Best
you are the best
it is really helpful tnx alot
Your video is so helpful! Thanks a lot! Please try to make more videos related to operations research topic such as MODI method, Degeneracy etc and others.
Thank you so much for this 😊 it help a lot! Im a new subscriber here ❤️
Thank you for joining with us 😊
You are so amazing thank you. You a new subscriber
Thank you. Its was really nice
U are the best teacher mama I love u
Wow! Thanks a lot.
this video saved me thankyouuu
Really helpful. Thank u :)
Thank youu so so much❤❤
🥀🥀Thankyou very much
Bohat mza aya
Thank you, you are so awesome!!
Thanks for this tutorial
Improve first the most negative.
Choose lesser in the negative signs. Subtract with the negative.
You are just too good
thanks for the video [love]
Nice demonstration
Please, could you confirm that after the first path is calculated, when no loop is possible , the optimization is obtained :
example :
factories= [8, 15, 21]
projects= [8, 36]
costs = [
[9, 16],
[7, 13],
[25, 1]
]
1st result
[[ 8 0]
[ 0 15]
[ 0 21]]
In this example as the first line and column( except 0,0) are made of of 0 , you cannot loop
If you reverse the 2 columns of the cost matrix , and the projects list, you can make a first optimization loop , but you get the same configuration without a possible loop .
1st result
[[ 8 0]
[15 0]
[13 8]]
Thank you.. 🥰🥰
Thank you so much 🙏👍
Very nice video... Keep growing dear...
Hi.. where is your video for MODI method
what shall we do if the value of two negative signs is the same like those in XB and YC the same 41?
Thank you very much ❤
good job dear
Madam your presentation was very simple and nice , I had one doupt in final all are positive then why you choose for last matrix , is there any rule is there or we can choose any one positive matrix
We can choose any matrix in the final step for calculation of cost because all are same.
Super
Nice video. However,which criteria did you use to decide which matrix will give you the most optimal cost amongst the others since they were all positive?
Thank u mam❤
love from bangladesh
Why did we skip off? @12:27? Please explain. What are the criterias for skipping off
Becoz we are considering allocated box for turning in that box there is no turning therefore we consider next allocated box
@Leo-se3fu thank you!
Do you have the MODI method?
Thank you miss
thank you in advance
Thank you
tnxxx
I need LCM with steeping stone method1
Check out another video
LEAST COST METHOD TRANSPORTATION PROBLEM | OPERATION RESEARCH | LECTURE - 1 | SSK EDUTECH |
thanks
i loved it :)
hope I can be your friend in messenger so I can ask questions on matters concerning linear programming.
Of course!! Let me know how can I help you?
Tq
Please stop that sound in background
I need to code it in a program. Someone knows how to code it?
In which program you want to code it?
@@LovepreetKaur-jc7km vba or python.
I LOVE YOU THAAANK YOUUUUUUUUUUUUUUUUUUUUUUUUUUUu
u fill find lut
QUESTION !!!
Is the North West Corner Method the same or different from the Stepping Stone Method ??
It is different. North west corner method is used to find feasible solution. However stepping stone method is used to optimise the feasible solution.
Why are you talking only english
thank you very much!!!