Integer Programming Problem (Part-2) Branch and Bound Technique to Solve IPP

[@MathPod]

We can do branching with respect to any variable, both gives same Optimal solution. I have made an arbitrary selection. If you don't want to make arbitrary choice then you can choose to do branching with variable which is associated to largest integral value. But we see in literature, the number of iterations are almost same in branch and Bound method, in simplex method ( Gomoary constraint) we make selection as mentioned above.

[@merin_here_am_i]

Mam, how to solve a binary linear integer programming with multiple variables? Which technique can be used?

[@vishnujatav6329]

Is Branch and Bound used only for 2 variable ? it is true?

[@priyankarnandi5063]

Yes it is , it's already mentioned in the previous video . When it's discussed about different ways to solve I.P.P(Integer programming problem ) .

[@KADOfficial23]

Maam fraction cut is not in syllabus kya??

[@meenakshirana6211]

Yes, fractional cut is not in syllabus.

[@tyuyhjk3866]

Mam please please 🙏🙏 upload remaining videos of integer programming problem.please.

[@MathPod]

Soon I will upload video on Gomary constraint, simplex algorithm for integer programming problem.

[@tyuyhjk3866]

@@MathPod thank you so much mam🙏🙏🙏🙏😄

[@Rahul-ub3uq]

mistake at 4,0 it will cut constraint 2

[@snehajadhav1765]

Maam can i get your emai I'd. I am not able to solve a integer programming minimization problem. Could you pls explain me .?