Great video! one of the few that shows how to calculate the next optimal point with a graph example, other videos I found just said "so this is the new z value" and I had no idea how they found that graphically. Saved me from madness thanks!
wow i dont know what to say now, you make it look very simple, easy and straight forward. thank you very much i dont think i can forget it wow. thank you again
21:58 I think your explanation for stopping the branching is true when the coefficients of objective functions are integers as well. So you can make sure that z will be integer. Otherwise you cannot make those decisions.
May i ask how do we choose the non integer value for branch? for both maximisation and minimisation case, is it like if maximisation case we choose larger non integer value to branch and for minimisation case we choose smaller non integer value to branch?
Hi Can you clarify which value you are talking about? For maximization, we choose the larger non integer z value for branching and opposite for minimizing. We look at the z value not the decision variables value. If that’s what you meant, you are right
Awesome video, thanks for explaining it so nicely! at 14:00, nothing bounds z to be an integer a priori, so in theory we should be branching LPP3 in hope of having something better than z = 23 (and still less than 23.33). Or am I missing something?
This is by far the best and simplest video on the Branch and Bound technique that I've found. This is just what I was looking for. Thank you so much!
Via Valderrama Thank you..
I truly agree
11:27 - Thank you so much for this part, it's not been explained in any other video I have watched on this.
This is the best example of LPP branch and bound that i have come across so far
by far the most simplest and best video - too good
Brilliant explanation. Thank you for taking time out and making others learning east and enjoyable.
Great video! one of the few that shows how to calculate the next optimal point with a graph example, other videos I found just said "so this is the new z value" and I had no idea how they found that graphically. Saved me from madness thanks!
Glad it was helpful
Best Video to understand Branch and Bound
Thank you. The essence of concept very well explained in simple words. Mam please do more videos on this subject.👍
wow i dont know what to say now, you make it look very simple, easy and straight forward. thank you very much i dont think i can forget it wow. thank you again
Thank you so much. Glad you liked it
Crystal clear explanation 👍🏻
Beautifully explained, thank you very much
21:58 I think your explanation for stopping the branching is true when the coefficients of objective functions are integers as well. So you can make sure that z will be integer. Otherwise you cannot make those decisions.
Yes right
Thankyou very much mam....very nice explaination ❣️
Very smooth, thanks
no video on Gomery's cutting plane method?
z=23 is obtained from the objective function given by substituting x1 and x2
Ur voice is awesome ......but I hope instead of just showing the screen solve the problem
May i ask how do we choose the non integer value for branch? for both maximisation and minimisation case, is it like if maximisation case we choose larger non integer value to branch and for minimisation case we choose smaller non integer value to branch?
Hi Can you clarify which value you are talking about? For maximization, we choose the larger non integer z value for branching and opposite for minimizing. We look at the z value not the decision variables value. If that’s what you meant, you are right
Awesome video, thanks for explaining it so nicely!
at 14:00, nothing bounds z to be an integer a priori, so in theory we should be branching LPP3 in hope of having something better than z = 23 (and still less than 23.33). Or am I missing something?
Thanks for your reply and glad that you liked it. You understood it correctly
Thank you for the explanation
Glad it was helpful!
You did great, thanks.
thank you doc, saved me
now this was so powerful
thank you so much ♥
Hello mam
Can you plz provide the solution for minimise
Z=-x-y
-2x+2y>=1
-8x+10y
your homework is for You mate :D