Yeqi Wei

Thank you so much, Jaromił! It works well. It is a great journey with Gurobi and you. Wish you all the best. :) Sincerely,Yeqi

Hi Jaromił, I got it! During the comparison, I force the variable into an integer int(v.xn) and it turns 0.99 to 0. So the constraints are indeed satisfied. Thank you for the help. May I ask an add...

Thank you, Jaromit,  I just used these two commands to save all 10 solutions, but they are identical. The second solution should be g =  [0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0] (I am checking my comparis...

Sorry for the late reply.  I pack the code, LP/MPS files, and also the outputs I saw into the following folder. https://uofi.box.com/s/r9ua2ttrz7k07ipnlj0x8f6liaav5flm  Using the following command ...

Thank you Jaromit. Yes. I didn't define x as Gurobi variable because it is a constant vector. Maybe I should define x as a variable instead? Sorry for the typo, it is x[0,86] - y[0,86] - z[0,90] <=...

Sorry for the misunderstanding. Here is the extracted MPS and LP file. https://uofi.box.com/s/qlww5ht4tlirresi03b8crl3sy9nztuw The one do not match is with idx = 90 and the first data sample. x[0,8...

Thank you, Jaromit. Sure. The goal is to find the g vector such that the summation of z vectors overall data samples is minimized. The x is known, and y is the convolution of x and g (computed by u...