Originally posted by: Rajasekhar_Kadambur

Hi,

I am trying to solve a LP problem, but CPLEX is solving it as a MIP. Is there any default setting for solving as LP problem.

Engine log ----

Found incumbent of value 1480000.000000 after 0.00 sec. (1.44 ticks)
Tried aggregator 2 times.
MIP Presolve eliminated 42704 rows and 117162 columns.
Aggregator did 864 substitutions.
Reduced MIP has 3438 rows, 5184 columns, and 9468 nonzeros.
Reduced MIP has 864 binaries, 0 generals, 0 SOSs, and 1648 indicators.
Presolve time = 0.61 sec. (1974.80 ticks)
Probing fixed 0 vars, tightened 238 bounds.
Probing time = 0.00 sec. (0.49 ticks)
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 24 threads.
Root relaxation solution time = 0.01 sec. (7.32 ticks)

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

*     0+    0                      8.74300e+007  8.86315e+008           913.74%
*     0+    0                      8.86315e+008  8.86315e+008             0.00%
      0     0        cutoff        8.86315e+008  8.86315e+008        0    0.00%
      0     0        cutoff        8.86315e+008  8.86315e+008        0    0.00%
Elapsed time = 0.66 sec. (1996.21 ticks, tree = 0.00 MB, solutions = 2)

Root node processing (before b&c):
  Real time             =    0.67 sec. (1999.13 ticks)
Parallel b&c, 24 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.67 sec. (1999.13 ticks)

Hi,

I see

Reduced MIP has 864 binaries, 0 generals, 0 SOSs, and 1648 indicators.

in your log.

Are you sure you do not have some piecewise or a max that could turn your LP into MIP ?

regards

Originally posted by: Rajasekhar_Kadambur

Hi Alex,

Thanks for response. my model is having max and abs, that is  the reason converting LP to MIP.