Ch06-03 Branch and Bound Method B&B for Integer Linear Programming ILP

This video is part of a lecture series available at / @decisionmaking101

[@pallavikalambe5596]

You are really a great teacher....i understood each word of yours....and thank you so very much for using the same example for all...It helps to develop good understanding about logic and methods.

[@simonjuenke4230]

thanks a lot man, your explanations are precise and easily to get, I would be lost without tutorials like this in my studies of all in OR, keep it up!

[@VishalKhopkar1296]

Perhaps the first video on branch and bound LLP which is short as well as having a clear explanation, thanks!

[@mengnixu7247]

i love your explanation. very precise and to the point. Thank you very much

[@Disha7003]

these videos are really great, very helpful. Please make videos for chapter 7 and 8 as well. Thank you so much

[@sokoo1978]

Nice and clear explanation, thanks!

[@shlemonmelon]

this was so helpful for my finals. Thank you!

[@diafarasacko9685]

thank for the great explaination and what does not gomory cutting methode exist in this chapter

[@hurabonobono06]

Thank you for uploading this kind of video. It really helps me a lot. :D

[@Jjolasman]

Best explanation ever!! thank you so much!!

[@dinathaib631]

Thank you , it's very clear explanation

[@vishyonkeys]

Can you explain why you chose to branch Node 2 first and not Node 3? You're reasoning is that Node 2 had a higher objective function value. How does that increase chances of solutions existing there?

[@sebcde]

Around 9:44, I'm not sure why you only change the upper bound for node 3 to 10.25, but keep 11.02 for node 2. Shouldn't the expected upper bound be the same for all nodes at one level? Amazingly clear video otherwise, thanks!

[@mengnixu7247]

same question here...

[@micahmungal3313]

Did you figure out why he did this?

[@swarnimamajumder7750]

Thanks a lot.You explained each step very efficiently.:)

[@sathyanarayanankulasekaran1674]

awesome explanation..thumbs up :)

[@charlelegrand9559]

Vielen dank ;) Es mir viel geholfen

[@MrGurk3000]

Really great explanation, thank you so much!

[@satbalak]

The videos are great!! They are of great help to me!! So heartfelt thanks! But I have a question - When you calculate optimality gap in node 1, shouldn't the denominator be 11.02 instead of 7?

[@sebcde]

nice catch, I'd have to agree with you, the optimality gap is more likely to be 36.5%. Maybe you can help clarify my own question above? I'm not sure if the presenter will still respond to comments here.

[@samrawlings6447]

very strong from you sir, thanks xo

[@elvirak.rwasamanzi1178]

Really helpful!

[@kinwengsiew1609]

in node 3, how to get 1.25 because i calculated a value of 1.75

[@BlankSabbath0410]

Bravo!

[@karimtahraoui3344]

thank you so much for the great videos :) i have a question please how did you change the value of X2 from node(1) to node(2) it was 1.83 -> 2.08 (i added the 0.77 taken from X1 but its not like that i think)

[@DecisionMaking101]

+soufiane sbaa In node 1, you solve the original problem. In node 2, you solve the original problem with an additional constraint x1

[@karimtahraoui3344]

+Decision Making 101 ooh i see ... so you add the new constraint every time and solve using the Simplex method now i get it, its much clear now thank you ;)

[@zenapsgas]

thank you

[@safakhelif1564]

If you have z min what I do?

[@jasonRhawt]

how did you get x2= 2.25?

[@gustavodambros3818]

Why did you only used the heuristic in the node 1 and not in the node 2 too?

[@DecisionMaking101]

+Gustavo Dambros Arbitrary choice. I could have used it in every node, but then the example would solve very quickly. Note that B&B solver can choose to run heuristics in some nodes only.

[@gustavodambros3818]

+Decision Making 101 ok, thank you very much :D

[@sliovr77]

Great explanation but why is Node 5 infeasible?

[@DecisionMaking101]

+Sagar Patel Node 5 is the original model plus two branching constraints x1=3. With those constraints, there are no feasible solutions, hence node 5 is infeasible. Solve graphically or using Excel if you are not convinced.

[@meribeqiri2789]

thanku for the video but i want to ask you how did you get 2.77 and 1.83?

[@benzola4808]

+meri beqiri you can find it in his previous video.

[@murthy562]

how to get the values for node 2 and node 3, without simplex

[@ArachnosMusic]

BVS MURTHY You could use the Lagrangian

[@shubhrikaahuja9646]

Can be done using the graphical method as the problem only involves two decision variables.

[@xmustkillx]

tyyy

[@StarzzLAB]

You have a polish accent, am i right?

[@KrzysztofFleszar]

+StarzzLAB CoRRect.

[@StarzzLAB]

Od razu wyczułem! super film, przydał się dzisiaj na kolokwium.

[@tobiasstrelow4073]

are you serious?

[@2911sagar]

bad accent.

[@용용-d2s]

IS That really important? lol