I'm currently solving a complicate potentially unbounded mixed integer linear programming problem. It seems that when the problem is unbounded, the GUROBI will return an integer feasible solution, but I wonder if that integer solution is always associated with an unbounded problem. I mean that if I fix the integer part of the solution in the problem to the returned solution, will the remaining problem be unbounded?
Also, it would be great if anyone can tell me a link in the documentation related to the solution of an unbounded MILP.
Please sign in to leave a comment.