Hello everyone,

I’m working on an integer linear programming (ILP) problem in MATLAB. When I solve the problem with a small number of variables, the solver quickly finds an optimal solution. However, when I increase the number of variables, the solver uses the branch-and-bound algorithm, which takes a long time. I would like to know if the ILP will display an optimal solution after the iterations of the branch-and-bound algorithm?

Any insights or tips on why the solver switches to branch-and-bound would be greatly appreciated!
Thank you!Hello everyone,

I’m working on an integer linear programming (ILP) problem in MATLAB. When I solve the problem with a small number of variables, the solver quickly finds an optimal solution. However, when I increase the number of variables, the solver uses the branch-and-bound algorithm, which takes a long time. I would like to know if the ILP will display an optimal solution after the iterations of the branch-and-bound algorithm?

Any insights or tips on why the solver switches to branch-and-bound would be greatly appreciated!
Thank you! Hello everyone,

I’m working on an integer linear programming (ILP) problem in MATLAB. When I solve the problem with a small number of variables, the solver quickly finds an optimal solution. However, when I increase the number of variables, the solver uses the branch-and-bound algorithm, which takes a long time. I would like to know if the ILP will display an optimal solution after the iterations of the branch-and-bound algorithm?

Any insights or tips on why the solver switches to branch-and-bound would be greatly appreciated!
Thank you! optimization, ilp MATLAB Answers — New Questions

​