Open etiennecallies opened 1 year ago
Indeed, if I try with CPLEX it returns optimal.
I recommend you to transfer this issue to the cbc team in https://github.com/coin-or/Cbc
Ideally, by sharing the mps file using lp_problem.writeMPS("error.mps")
.
Hi @pchtsp ! Thanks for having looked at it. I just submitted this issue on CBC repo: https://github.com/coin-or/Cbc/issues/632
Hi,
I'm using
PuLP==2.7.0
(tried also to install pulp from source).I got
Infeasible
status on this solvable problem :It is indeed solvable if all
x
are 1 andc
are 0. Whenever I try to reduce it , I gotOptimal
. For example when I use this constraint :Or even when I rename some variable.
Am I doing sth wrong, or is there a bug?
Details for the issue
What did you expect to see?
I expected the problem to be solvable.
What did you see instead?
I got
Infeasible
.Useful extra information
The info below often helps, please fill it out if you're able to. :)
What operating system are you using?
I'm using python version:
I installed PuLP via:
Did you also
Thanks