Xuan Lin

Hi Riley, My apologies for this super late reply. I have condensed my code but unfortunately, it still have ~150 lines. I use the x0=0 initial condition and run for 10 times. This code has 2 models...

Hi Riley, Could you confirm that I should submit the model through uploading port such as https://www.gurobi.com/upload-a-model/? Thank you! - Xuan

Hi Riley, In addition to what I put down above, it seems both models give: Statistics for modelPresolved:  Linear constraint matrix    : 0 Constrs, 0 Vars, 0 NZs  Matrix coefficient range    : [ 0,...

Hi Riley, I only build the model once and the later runs I modify the model. Therefore, I believe MIP start is automatically generated inside Gurobi. - Xuan

Hi Riley, The variable x0 is a vector with 4 elements, that is why there are 4 additional columns. There are ~700 constraints, hence the additional 3000 non-zero terms. I was trying to run the same...

Hi Riley, Sorry when I made that comment my mind was not very clear. I made a small test code using some data collected from my experiment, and still observe the difference of speed. The same thing...

Hi Riley, Thanks to your great trick, I am able to modify the constraint significantly faster. I added a continuous variable x shared by all constraints and set the upper bound and lower bound iden...

Hi Riley, Thanks for the reply! My apologies I forgot to mention that delta is computed for each constraint i hence will vary, but there might be a way that I can transform them to depend on a sing...

Hi, I have a follow-up question: When Gurobi compute Farkas dual for linear programming problem with mixed equality and inequality constraints, does it find a Farkas dual that satisfies the conditi...

Hi Riley, Thanks for the discussion and reply! Yes, the original QP problem has linear constraints and a quadratic objective function. I am trying the method you suggested. It might be the case tha...