[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:
Resolution:              |   Keywords:
-------------------------+----------------------

Comment (by blegat):

 I asked the same question for Gurobi (here:
 https://groups.google.com/forum/#!topic/gurobi/cKZY6huEBZo) and they
 replied that the solver stops as soon as it finds an unbounded ray and
 therefore has no guarantee on the feasibility of the problem. This is also
 explained here:
 https://www.gurobi.com/documentation/7.0/refman/optimization_status_codes.html
 Therefore, to obtain a feasible solution, one needs to set the objective
 to 0 and reoptimize.
 Is it the same for Clp ?

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