[Cbc-tickets] [COIN-OR Branch-and-Cut MIP Solver] #145: Infeasibility issue in MIP model built using flopCpp

[COIN-OR Branch-and-Cut MIP Solver]

#145: Infeasibility issue in MIP model built using flopCpp
-------------------------+-------------------------------------------------
Reporter:  krakesh.iitk  |      Owner:  tkr
    Type:  task          |     Status:  new
Priority:  major         |  Component:  Cbc
 Version:  2.7           |   Keywords:  Infeasibility, Mixed Integer
                         |  Programming
-------------------------+-------------------------------------------------
 Hi,

 I am solving an assignment and scheduling problem which is MIP and calling
 OsiCbcSolverInterface from flopCpp to solve it. The solver is throwing
 that 'The LP relaxation is infeasible and too expensive'. I like to know
 if there is any functionality in COIN cbc library to check which
 constraint or group of constraints are causing infeasibility and also how
 to deal with these infeasibility issues in COIN environment. I know this
 functinality is available in CPLEX where CPLEX allows users to remove
 IISs(Irreducible Infeasibility Sets) but could not find it in COIN. May be
 I am completely unaware that this functionality does exist in COIN but I
 am unable to locate it. So please help to resolve this.

 Thanks,
 Rakesh

--
Ticket URL: <https://projects.coin-or.org/Cbc/ticket/145>
COIN-OR Branch-and-Cut MIP Solver <http://projects.coin-or.org/Cbc>
An LP-based branch-and-cut MIP solver.