Gurobi solver, algorithm
Answered
Hi! I am currently writing my thesis, which is about optimization. The problem is a mix of the facility location problem and transport problem. I've been coding with python, using the gurobi solver to get results (linear programming). My question is if this solver uses a specific algorithm to find optimal values, or if it just brute forces?
What I have understood from scientific articles, the problem could be np-hard. Those papers have used combined algorithms to find a solution, or simply tried brute force. I am just curious to know if my solution comes from a specific algorithm/s or brute force in the gurobi solver. It would help in order to analyse my results correctly. Would be really grateful for a reply.
Best regards, Isabella
-
Official comment
-
Gurobi Staff
This post is more than three years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum. Or why not try our AI Gurobot?. -
-
-
Hi Isabella,
Gurobi uses many different heuristics to find feasible solution points. Most of them are well known and can be found in the literature, e.g., feasibility pump or neighborhood searches. You can see whether a feasible point has been found by some heuristic if there is an "H" written as the first character of a B&B line. If there is an asterisk " * ", then a feasible point has been found by branching, see MIP Logging. It is not possible to determine which heuristic found the given feasible solution.
To learn more, I strongly recommend having a look and our Webinars and Events and Books and Blogs sections.
Best regards,
Jaromił0 -
Post is closed for comments.
Comments
2 comments