You wouldn’t normally need to investigate further branches under the first right branch (X2 >= 3) is that correct? The objective value in the relaxed subproblem (26.75) is less than the current best (27) therefore no further branch can possibly yield anything better.
That's amazing cause i had spent about 3 hours to re-learn this section in the classroom but you have just helped me to tackle it just in 17 mins. Thanks so much!
This is fantastic! I learned branch and bound in like 10 minutes because of you. I really thought it was hard but my lecture notes are just so unclear..
Thanks for the detailed description of the branch and bound algorithm. I just would like to make a small note for the given problem. Since the objective function is the result of summing up the multiplications of the integer decision variables by integer coefficients, the optimal objective function value must be an integer. Since the optimal LP relaxation solution at the root node (subproblem1) is 27.67, so we can claim that 27 is an upper bound. Since the solution of the subproblem at the first branch is found to be 27, we can stop without the need to explore the other branches. This is a detailed description of the previous comment by Lekshman Ramesh.
Thank you and that is correct! I went through the whole branches for learning purposes and also in cases where the order of solving subproblems are so that one goes through the right branch before going to the left ones.
exam is in two days, and I feel soooo relieved I found your videos before my exam!!!! Thank you so much, I struggled so hard with my notes and my teachers, but you managed to make it clear and simple!!! Thanks!!! I hope I’ll pass!!!
Thank you for the video, it's very clear and concise! I have an exam in a few days and you've saved me hours trying to understand my professor's explanation.
thank god i've found your video! i was getting frustrated but now.....FINALLY i understand what i must do in just 10minutes! didn't even know that it was this easy! your explanations are so clear !
Thanks a lot!! I have watched about 4 long videos and understood nothing. You made it in 10 minutes, finally I got the meaning of algorithm! Keep going that way, your approach of explaining the problems is really good 😊
I think there is a mistake @ 11:10, when you have found z= 26.75 for x1=1.75 and x2=3; you don't need to proceed further down since all the sub-problems of this branch will give solution z
thank you so much for this video 🙏🏼 loved how you always put the graphics next to the branches and explained it so well and understandable 🙏🏼 thank you for your effort 😊
Thanks alot mam I'm so confused wd this because my staff was not perfectly teach this method .now I'm very clear 😍hpy to watch your videos once again Tqq so much mam
To be able to find a point that maximizes our objective function, we started by putting the objective function equal to some arbitrary number.This arbitrary number is 15. You can put this function equal to any number that you would like.
I believe you mentioned that the optimum has to be at a vertex because it's a convex set, at 2:18, but I think that you have to require a concave objective function for that to be true.
The sub problem z=26.75 is less than current better solution z =27 ,x=(3,2)are already integer ，so the best solution is 27,so u should stop the following calculation .
This was an excellent explanation! I am taking Operations Research at the University of Maine at Augusta and I sure wish you were an instructor there. This is much more straightforward than our instructors' lectures! Fantastic right before an exam, thank you!
how do you know which constraint to use, to replace the x values? because in some cases shes using constraint 2 and in the first case she used constraint 1
You wouldn’t normally need to investigate further branches under the first right branch (X2 >= 3) is that correct? The objective value in the relaxed subproblem (26.75) is less than the current best (27) therefore no further branch can possibly yield anything better.
yes, I mention that in the video, and if you don't skip you will hear that as well. Thanks!
Must have missed it. Thank you very much
Damn
@@bazingazeroni haha
@@bazingazeroni
you made a thing, that all my professors make sound difficult, sound easy. you have a gift. thank you.
Thanks for the feedback!
A solid hour of confusion gone in just 20 min.! You're a lifesaver thanks so much!!
That's amazing cause i had spent about 3 hours to re-learn this section in the classroom but you have just helped me to tackle it just in 17 mins. Thanks so much!
Literally, a life saver before my exams.. thank you
This is fantastic! I learned branch and bound in like 10 minutes because of you. I really thought it was hard but my lecture notes are just so unclear..
I'm watching your playlist approximately two hours before my test. Thanks for saving me!
I wish, there was more Integer Programming videos, that you made. Thanks Professor.
Thanks for the detailed description of the branch and bound algorithm. I just would like to make a small note for the given problem. Since the objective function is the result of summing up the multiplications of the integer decision variables by integer coefficients, the optimal objective function value must be an integer. Since the optimal LP relaxation solution at the root node (subproblem1) is 27.67, so we can claim that 27 is an upper bound. Since the solution of the subproblem at the first branch is found to be 27, we can stop without the need to explore the other branches. This is a detailed description of the previous comment by Lekshman Ramesh.
Thank you and that is correct! I went through the whole branches for learning purposes and also in cases where the order of solving subproblems are so that one goes through the right branch before going to the left ones.
Thanks I was looking for confirmation
Thank you! I have an exam in 2 hours and you saved my life.
It’s easier to solve math problems after watching this video！Thank you so much😊
Not sure why textbooks can't be this clear, but thanks, that was amazing. Almost like they don't want you to know or something.
exam is in two days, and I feel soooo relieved I found your videos before my exam!!!! Thank you so much, I struggled so hard with my notes and my teachers, but you managed to make it clear and simple!!! Thanks!!! I hope I’ll pass!!!
glad that it was helpful!
Your explanation is very clear and the problem is simple enough to follow. Thanks a ton!!! I really appreciate this.
It is my first time working on this popular algorithm and from your video, I feel like I understand it so well. Thank you.
Thank you for the video, it's very clear and concise! I have an exam in a few days and you've saved me hours trying to understand my professor's explanation.
thank god i've found your video! i was getting frustrated but now.....FINALLY i understand what i must do in just 10minutes! didn't even know that it was this easy! your explanations are so clear !
thank you very much =)). I literally didn't understand a thing about IP until i watched your video
Thank you so very much, I have an exam and you saved me
You make the best LP videos on RUclips hands down. Thank you so much!
I was searching for a video about Branch & Bound Method and finally got here. It was the best of all. Simple and easy to understand. Thank you :)
Thanks a lot!! I have watched about 4 long videos and understood nothing. You made it in 10 minutes, finally I got the meaning of algorithm! Keep going that way, your approach of explaining the problems is really good 😊
I think there is a mistake @ 11:10, when you have found z= 26.75 for x1=1.75 and x2=3; you don't need to proceed further down since all the sub-problems of this branch will give solution z
your explanation is quite clear, thanks mirzaei!
Lol! My OR teacher need to see this.
Thank you mam.
A very clear explanation with additional subtitle that really helped a lot. Thank you very much!
You got a sweet voice that makes learning quicker
thank you so much for this video! I passed my course!
oh..really technique is good for explanation .im from india.you are a good teacher.😘😘😘
thank you so much for this video 🙏🏼 loved how you always put the graphics next to the branches and explained it so well and understandable 🙏🏼 thank you for your effort 😊
Thank you for saving my final exam
I'm in class right now and I'm so confused. Leaving a comment here so that I revisit this video after my class.
واقعا مفید و کمک کننده بود. ممنون👏🏻❤️
Thank you, you make the best videos on RUclips!
Thanks very much. Very clear explanation and really helped to answer this method in my exam.
Many thanks for sharing this. Very clear and concise.
thank you, you are a lifesaver
Very nice explanation 👍
Thank you very much it's the best video,simple and very clear
It is very well-prepared and helpful video, thanks for your work.
You are simply fantastic! Excellent lesson.
Thank you!
Love the way you teach...Hats off
thank you, better than my uni teacher
Best! Thanks a lot Shokoufeh Mirzaei!!!
So explanatory. I love you Abeg
. u 2 much ❤
This is just such a great explanation, thank u so much!
خیلی ممنون سرکار خانم میرزایی ^^ بسیار عالی بود
Great explanation! Thank you!
Thanks alot mam I'm so confused wd this because my staff was not perfectly teach this method .now I'm very clear 😍hpy to watch your videos once again Tqq so much mam
ruclips.net/video/fRyUf-GY754/видео.html ..💐
a very clear explanation ... thank you so much
This video is amazing, thank you for a simple and straightforward explanation💚🦋
Thank you for such a great explanation of this problem. 🙂
I WILL NOT FAIL MY EXAMS
GL YALL
Amazing Explanation! Great job
Thanks so much.. Now I can understand so well
superb explanation
Very well explained. Thankyou. 😊
thank you soooooo much ! This is really helpful! you saved me 😢
That was really clear and you made it so much easy to understand. Thank you for helping us to understand this topic very well 🙋🏼♂️
Omg you've saved my day!! Thank you very much ❤️❤️❤️❤️
lovely presentation ma'am
Thanks, It was easy to follow
wow, really great video.
Thank you so much. This video had been really helpful
@3:25. for your optimal function. where did the 15 come from?
To be able to find a point that maximizes our objective function, we started by putting the objective function equal to some arbitrary number.This arbitrary number is 15. You can put this function equal to any number that you would like.
@@mervesafaarkan32 thanks Merve!
can you teach again without the graphical method, my lecturer didnt use graphical first
Such a great video thanks a lot for sharing it ♥️♥️
Great stuff!
Thanks! It`s very useful!
Thanks! The explanation is very clear. You sound like Francesca from Master of None, btw.
I believe you mentioned that the optimum has to be at a vertex because it's a convex set, at 2:18, but I think that you have to require a concave objective function for that to be true.
Thank you so much, you made it so amazingly easily understandable! :)
خیلی ممنونم :)
Thank you. This helped me a lot
BIG THANK YOU FOR THIS
REally Amazing
Thanks alot Mirzei....
Thanks alot. So helpful
Perfect. Thank you very much.
Ohhhh thank you a lot from Italy!
Where we found x1=1.75 in second branch?
explain very well thank you so much
Thank you for your illustrative and useful tutorial video
This video is sooooo good. Thanks alot!
The sub problem z=26.75 is less than current better solution z =27 ,x=(3,2)are already integer ，so the best solution is 27,so u should stop the following calculation .
It WAS EASY MAN
Thank you ma'am ☺️
Well explained , thank you !
very clear, thank you!
Thank you! Very great explanation.
This was an excellent explanation! I am taking Operations Research at the University of Maine at Augusta and I sure wish you were an instructor there. This is much more straightforward than our instructors' lectures! Fantastic right before an exam, thank you!
خیلی عالی بود 👍 😊
Very well explained thank you. Norouz mobarak :-)
Thanks! likewise :)
Thank you for your help! 🙏
Good job thanks
It's great !!!
thank you!!
Thank you very very very much!!
how do you know which constraint to use, to replace the x values? because in some cases shes using constraint 2 and in the first case she used constraint 1
Thank you well done!
very good, thnx from italy :)
Well made, thanks Shokoufeh. :)