LP algorithms

[Saber Elsayed]

Hello,

What are the LP solvers/algorithms used in Gurobi to solve Integer-programming problems? Any references will be highly appreciated.

Thanks in advance

[Tobias Achterberg]

In order to solve integer linear programs we use an LP-based branch-and-cut
algorithm, with the LPs being typically solved by the dual simplex algorithm.
Sometimes, we also employ the barrier algorithm or the primal simplex algorithm.

You could read https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/1112
chapters 2-3 to get picture about the algorithms that are used in MIP solvers.


Regards,

Tobias

[Saber Elsayed]

Thanks Tobis