The objective bounds improve slowly!
I have a SOC programming problem, which I try to solve. It takes to much time to find an incumbent objective bound, and when it finds one, it improves slowly. I tried different parameters, but it didn't work.
Could anyone help me with it?
I have encountered the same problem, did you find the reasons and solutions now?
I realized that my SOC constraint causes this issue, and makes the problem hard to solve. Besides, I wanted to solve a big problem. When I chose smaller ones, it solves but still takes time. Just make sure to play around with MIPFocus and NodeMethod parameters if you are solving a MIP.
Dear Nazanin Madani,
Thanks for your reply.
Can I further ask how you deal with your problems, to improve the constraints or improve setting parameters or both?
By the way, can you expand a bit about the constraints problem, like 'big-M constraints' or too loose constraints or...?
As I am now stuck here for several days, having tried checking the model carefully(variables & constraints&objectives) and tuning some parameters, including the ones you mentioned.
thanks a lot, and looking forward to your reply.
Please sign in to leave a comment.