You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
For the trivial problem (see attachment for an mps):
Minimize x0 + x1 Subject To
Bounds
x1 >= 0
x1 free
End
Clp correctly detects it to be unbounded but returns NULL when asked for the Unbounded ray (see here).
While it may look silly to ask Clp to solve such a trivial problem, this actually happens as part of a larger algorithms (see here) so it wasn't generated by hand and the fact that Clp fails on such simple problems makes it unusable for the whole algorithm :(
The text was updated successfully, but these errors were encountered:
Issue created by migration from Trac.
Original creator: blegat
Original creation time: 2017-06-01 10:28:47
Assignee: somebody
Version:
Dear Clp maintainers,
For the trivial problem (see attachment for an mps):
Minimize x0 + x1 Subject To
Bounds
x1 >= 0
x1 free
End
Clp correctly detects it to be unbounded but returns NULL when asked for the Unbounded ray (see here).
While it may look silly to ask Clp to solve such a trivial problem, this actually happens as part of a larger algorithms (see here) so it wasn't generated by hand and the fact that Clp fails on such simple problems makes it unusable for the whole algorithm :(
The text was updated successfully, but these errors were encountered: