Branch and Bound Technique for Integer Programming | Lec 6 | Operations research |
Channel: Mechpro classes
Date: 18/06/2020

In this video we have covered the theoretical portions (Definitions, steps and structure) of branch and bound techniques for applying to solve integer programming problems and in the later part we solved an example on integer programming problem applying branch and bound technique.

Branch and bound is a systematic method for solving optimization problems. The branch and bound approach is based on the principle that the total set of feasible solutions can be partitioned into smaller subsets of solutions. These smaller subsets can then be evaluated systematically until the best solution is found.  

Branch-and-bound (B&B) is a general programming paradigm used, for example, in operations research to solve hard combinatorial optimization problems. Branching is the process of spawning sub-problems, and bounding refers to ignoring partial solutions that cannot be better than the current best solution.

#branchandboundtechnique#integerprogramming#branchandbound#mechproclasses#operationsresearch#mechanicalengineering

If this video seems to be helpful to you than subscribe to our channel for more updates and Share it to your friends.

For full playlist of Queuing Theory click below at:
https://www.youtube.com/playlist?list=PLBUT1n4c7KU6DH-OIrR6-tSegid3QkZXK

For full playlist of Operation Research click below at:
https://www.youtube.com/playlist?list=PLBUT1n4c7KU6FsNb0Mf-6vlADQ63QYTXr