[Clp-tickets] [COIN-OR Linear Programming Solver] #80: Infeasible solution returned when problem is unbounded

[COIN-OR Linear Programming Solver]

#80: Infeasible solution returned when problem is unbounded
------------------------+----------------------
 Reporter:  blegat      |      Owner:  somebody
     Type:  defect      |     Status:  new
 Priority:  major       |  Milestone:
Component:  component1  |    Version:
 Keywords:              |
------------------------+----------------------
 Dear Clp maintainers,

 When trying to solve the following problem

 {{{
 Maximize x1

 Subject To

 x1 >= 1

 Bounds

 x1 free
 x2 <= -1

 End
 }}}

 Clp detects unboundedness and reports a correct unbounded ray but returns
 an infeasible solution (i.e. `[0, 0]`).

 Can we expect Clp to return a feasible solution when the problem is
 unbounded ? We are currently wondering whether this is a reasonable
 expectation for LP solver
 [https://github.com/JuliaOpt/MathProgBase.jl/pull/144 here].

--
Ticket URL: <https://projects.coin-or.org/Clp/ticket/80>
COIN-OR Linear Programming Solver <http://projects.coin-or.org/Clp>
A linear programming solver.