Seyedkianoush Mousavichashmi

Hi, I have implemented a branch and cut algorithm where my subproblems are mixed integer program with bilinear objective function. Here is the groubi log of my subproblem: Gurobi Optimizer version ...

Hi, I am solving a non-convex problem with bilinear objective via Gurobi. I can solve the problem analytically to optimality and I am aware of the optimal solution. When I use Gurobi (with presolve...

Hello,   I am applying Benders decomposition via callback to my problem. I noticed that I can generate heuristic solution from integer solution which is possibly better than the best objective foun...

Hi, I have a MILP problem with a tight LP relaxation. In order to get the MILP value functions, I use LP relaxation duals. When solving the MILP, I noticed in the root node has a much better bound ...

Hi,   I noticed that in the multi-scenario feature of Gurobi, there is no option of removing scenarios.   This is problematic when we use a model iteratively instead of creating and deleting a mode...

Hi, I'm using the Gurobi Multi-Scenario model (scenarios are based on right-hand sides) and I solve it iteratively. So in each iteration, I have a new base model and a new set of scenarios (which i...