Xuan Lin

Hi,Thanks! I have another baseline model that is equivalent, but with looser convex relaxations and about 2x more constraints. The solving speed is usually slower. For this case, I got memory usage...

Hi Riley,Yes, running gurobi_cl point_mass_04_lnf.mps works ok and generate the logfile correctly.I figured that if I run:psrecord "gurobi_cl point_mass_04_lnf.mps" --include-children --log activit...

Hi Jaromił, Thank you for the explanation! I have a follow-up question regarding this issue. Are the techniques disabled by activating LazyConstraints inherently incompatible with lazy constraints,...

Hi Riley, Thanks for the answer! I personally haven't used any GPU-based QP solver. I have heard about some research to accelerate QP solvers using GPUs, for example, this one. I think ADMM is know...

Hi Jaromił, Thanks for the answer! I actually didn't know that QPs can be solved with simplex. May I ask a minor question: does the column "unexplored nodes" always goes to 0 as the algorithm termi...

Hi Jaromił,   Thanks for the answer! The column It/Node shows the average number of Simplex iterations performed per node, i.e., the average number of Simplex iteration to solve a problem A to opt...

Hi Riley, Thanks for the answer! I think using simplex instead of concurrent solvers helps to reduce memory usage. I also managed to reduce the model size by improving the formulation. I have a mor...

Hi Riley, Yes, what you said is correct, that is why the code I put here is a simplified model for debugging purposes. I have the complete model (~400 lines) that sets lb=ub to various nonzero valu...

Hi Riley, Thanks for the feedback and suggestions! I apologize for the complicated code, as I tried to keep the structure of the model to represent the original one. The x0_new[i_x] is always 0 - t...

Hi Riley, Does this work: https://drive.google.com/file/d/1vSNy0fVahVJsfrReZzjI9lfIXBEe7sUW/view?usp=sharing? I use the following code to read it into list of np.array: import csvfeas_cuts_offline ...