We have a number of test libraries to test solver performance like MINLPLIB, QPLIB, etc., but the problems in all libraries I know are overwhelmingly on the feasible side.
Is there a library to test a solver's ability to prove infeasibility?
We have a number of test libraries to test solver performance like MINLPLIB, QPLIB, etc., but the problems in all libraries I know are overwhelmingly on the feasible side.
Is there a library to test a solver's ability to prove infeasibility?
You can check the following weblink: