[Clp-tickets] [COIN-OR Linear Programming Solver] #15: Feasible problem returns infeasible; inconsistent results

[COIN-OR Linear Programming Solver]

#15: Feasible problem returns infeasible; inconsistent results
-------------------------+--------------------------------------------------
  Reporter:  ltaylor     |       Owner:  somebody
      Type:  defect      |      Status:  closed  
  Priority:  major       |   Milestone:          
 Component:  component1  |     Version:          
Resolution:  worksforme  |    Keywords:          
-------------------------+--------------------------------------------------
Changes (by ladanyi):

  * status:  new => closed
  * resolution:  => worksforme

Comment:

 Same things happen for me as for JP: 1.6.0, stable/1.6, trunk all return
 infeasible both with primals and duals. I compiled with VC++ Express.

 cplex also determines the problem to be infeasible. The two solvers agree,
 so I doubt that the problem would be feasible, i.e., the basis supplied in
 the zip file could be an optimal basis.

 For now I close the ticket. LAT, feel free to reopen the ticket if you
 still think that there is problem.

 --Laci

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