Question: Branch and Bound method is a mathematical optimisation algorithm used to solve combinatorial optimisation problems. It is an exact algorithm that systematically searches through all

Branch and Bound method is a mathematical optimisation algorithm used to solve combinatorial optimisation problems. It is an exact algorithm that systematically searches through all possible solutions to find the optimal solution. Maximum Profit, z=9x1+7x2 Subject to 9x1+3x222 x1+2x28 x1+x23 x1,x20 and integer The following is the optimal linear programming tableau: 20 marks
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
