Xuan Lin

Hi,I have two equivalent optimization models with different formulations that result in different numbers of variables and constraints. I want to compare their memory usage to demonstrate that one ...

Hi,I'm trying to use Gurobi 12.0.2 with gurobipy, but I have encounter some conflicting information. When I try to install with:~/Desktop/gurobi1200/linux64$ pip install -e.I got error:Obtaining fi...

Hi, I am trying to implement the Branch and Benders Cut algorithm using callback functions. My simplified code setup has: // master.cpp file// Initialize the master problem classMaster::Master(){  ...

Hi, I have a question regarding the explored nodes after reading the MIP Logging. I will start with my understanding of Branch and Bound: Initialize an empty list of relaxed problems L=[]. Put root...

Hi, I am solving MILP models and trying to scale them up. When I try a smaller model like below, Gurobi quickly goes to the branch and bound procedure which solves the model very fast. I record one...

Hi, When I solve QP, is there a function to get the dual optimizers for the problem, that is, the optimal x for at slide 3 here http://www.seas.ucla.edu/~vandenbe/ee236b/lectures/duality.pdf? Note...

Hi, I am using gurobipy to repeatedly solve a model with changing constraints' right-hand side. Right now, I am doing: for i in range(number_of_constraints):    model.getConstrByName(constraint_nam...

Hi,I am trying to solve a quadratic programming problem: min x^{T} Q xs.t.G_{1}(x) <= 0G_{2}(x) <= 0...G_{n}(x) <= 0 Specifically, if the problem is infeasible, I want to get a convex combination o...