Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

HeuristicDiveMIP::solution asserts with honor_original_bounds=no from ipopt 3.14.x #24

Closed
jschueller opened this issue Jun 25, 2021 · 2 comments

Comments

@jschueller
Copy link
Contributor

jschueller commented Jun 25, 2021

with ipopt 3.14 I get this assertion with BB algorithm:

BonHeuristicDiveMIP.cpp:133: virtual int Bonmin::HeuristicDiveMIP::solution(double&, double*): Assertion `isNlpFeasible(minlp, primalTolerance)' failed.

I found out that ipopt 3.14 changes the default value of honor_original_bounds and that triggers the assertion wrt ipopt<3.14
For now I need to set honor_original_bounds=yes.
Should something be changed in Bonmin regarding ipopt>=3.14 ?
I'm also wondering if a new release is expected.

@svigerske
Copy link
Member

Thanks for tracking this down.
The only thing I checked with regard to Ipopt 3.14 was that Bonmin still compiles, though with plenty of deprecation warnings. make test also passed, I believe.

I'm adding the honor_original_bounds=yes to the place where Bonmin changes Ipopt options. I hope that will do. An alternative would be to be more relaxed in isNlpFeasible().

@svigerske
Copy link
Member

Regarding releases from master, Bonmin waits for Cbc to do a release.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants