Originally posted by: Mathsg

 Hi, 

I am getting infeasible solution. I am not sure weather their is a conflicts among constraint or why i am getting infeasible solution. When i run the configuration i get the result like this in engin log. 

Tried aggregator 1 time.
LP Presolve eliminated 194 rows and 13 columns.
Aggregator did 2 substitutions.
Reduced LP has 6 rows, 30 columns, and 60 nonzeros.
Presolve time = 0.00 sec. (0.09 ticks)

Iteration log . . .
Iteration:     1   Dual objective     =             1.000000
Tried aggregator 1 time.
MIP Presolve eliminated 196 rows and 13 columns.
MIP Presolve added 15 rows and 15 columns.
Reduced MIP has 21 rows, 45 columns, and 105 nonzeros.
Reduced MIP has 30 binaries, 15 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.02 sec. (0.13 ticks)
Probing time = 0.00 sec. (0.01 ticks)
Tried aggregator 1 time.
Reduced MIP has 21 rows, 45 columns, and 105 nonzeros.
Reduced MIP has 30 binaries, 15 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (0.06 ticks)
Probing time = 0.00 sec. (0.01 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 4 threads.
Root relaxation solution time = 0.00 sec. (0.04 ticks)

        Nodes                                         Cuts/
   Node  Left     Objective  IInf  Best Integer    Best Bound    ItCnt     Gap

      0     0    infeasible                                          5         

Root node processing (before b&c):
  Real time             =    0.11 sec. (0.48 ticks)
Parallel b&c, 4 threads:
  Real time             =    0.00 sec. (0.00 ticks)
  Sync time (average)   =    0.00 sec.
  Wait time (average)   =    0.00 sec.
                          ------------
Total (root+branch&cut) =    0.11 sec. (0.48 ticks)
Kindly guide me in this regards, Thank you. I am looking forward to hearing from someone