The same code run smooth in a smaller scale system, but cannot work for a larger scale system. The objective is -Infinity. Have you ever met similar problem?
mipdisplay 2
timing 1
timelimit 3600
treememory 2048
MIP Presolve eliminated 38761 rows and 17480 columns.
MIP Presolve modified 47881 coefficients.
Reduced MIP has 138559 rows, 98251 columns, and 524393 nonzeros.
Reduced MIP has 10296 binaries, 0 generals, 0 SOSs, and 0 indicators.
Probing fixed 0 vars, tightened 5687 bounds.
Probing time = 0.27 sec.
MIP Presolve eliminated 1082 rows and 479 columns.
MIP Presolve modified 5539 coefficients.
Reduced MIP has 137477 rows, 97772 columns, and 519990 nonzeros.
Reduced MIP has 10383 binaries, 0 generals, 0 SOSs, and 0 indicators.
Found feasible solution after 5.23 sec. Objective = -1.#INFe+000
Probing time = 0.08 sec.
Clique table members: 4098.
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 4 threads.
Root relaxation solution time = 6.07 sec.
Nodes Cuts/
Node Left Objective IInf Best Integer Best Bound ItCnt Gap
* 0+ 0 -1.#INF0e+000 10652 ---
0 0 cutoff -1.#INF0e+000 10652 0.00%
Root node processing (before b&c):
Real time = 8.19
Parallel b&c, 4 threads:
Real time = 0.00
Sync time (average) = 0.00
Wait time (average) = 0.00
-------
Total (root+branch&cut) = 8.19 sec.
Times (seconds):
Input = 0.604
Solve = 13.156
Output = 0.524
CPLEX solution status 12 with fixed integers:
phase II objective limit exceeded
IBM ILOG CPLEX Optimization Studio Commercial Edition
CPLEX
12.4.0.0: optimal integer solution; objective -Infinity
10652 MIP simplex iterations
0 branch-and-bound nodes
Status recovering solution: phase II objective limit exceeded
"option abs_boundtol 2.842170943040401e-14;"
or "option rel_boundtol 3.513190288059828e-16;"
will change deduced dual values.