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?
$\begingroup$
$\endgroup$
6
-
$\begingroup$ To be interesting, include models for which feasibility is unknown. For instance, for MILP, see twitter.com/Ed_Klotz/status/1186091930582704129 . $\endgroup$– Mark L. StoneOct 31, 2019 at 15:38
-
$\begingroup$ here is a long list of NLP and MINLP test problems (minlp.com/nlp-and-minlp-test-problems) you may find some test problems for infeasible ones as well. $\endgroup$– Oguz ToragayOct 31, 2019 at 16:10
-
2$\begingroup$ For any feasible library instance with objective function $f(x)$ that we are maximizing and a known optimal objective value $o$, you could add a constraint $f(x) \ge o+1$ to get an infeasible problem instance. So my guess is that you could pretty easily build such a library from existing ones. $\endgroup$– josliberNov 1, 2019 at 17:43
-
$\begingroup$ @josliber For an MINLP wouldn't that just set the global optimum to another local optimum of the original problem? $\endgroup$– Nikos KazazakisNov 2, 2019 at 10:38
-
2$\begingroup$ @nikaza Presumably josliber intends $\alpha$ to be the global maximum objective value, so adding the stated constraint renders the problem infeasible. Perhaps you read it as minimum, not maximum. .... While these would be infeasible problems, hopefully they would only be a part of an infeasible problem library, because all the infeasibilities would be of the same type, due to a single inequality involving the objective function. $\endgroup$– Mark L. StoneNov 2, 2019 at 10:59
|
Show 1 more comment
1 Answer
$\begingroup$
$\endgroup$
1
You can check the following weblink:
-
$\begingroup$ Do you know which and how many of these within each library are infeasible? Anyhow, you should also add this to or.stackexchange.com/questions/244/… . $\endgroup$ Mar 18 at 11:27