Opened 2 years ago

Closed 8 months ago

#82 closed defect (migrated)

Unbounded ray not found when there are no constraint

Reported by: blegat Owned by: somebody
Priority: major Milestone:
Component: component1 Version:
Keywords: Cc:

Description

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 :(

Attachments (1)

ticket82.mps (139 bytes) - added by blegat 2 years ago.
Trivial unbounded problem for which the unbounded ray is not found

Download all attachments as: .zip

Change History (2)

Changed 2 years ago by blegat

Trivial unbounded problem for which the unbounded ray is not found

comment:1 Changed 8 months ago by stefan

  • Resolution set to migrated
  • Status changed from new to closed

This ticket has been migrated to GitHub and will be resolved there: ​https://github.com/coin-or/Clp/issues/82

Note: See TracTickets for help on using tickets.