MIP emphasis: balance optimality and feasibility.
Reduced MIP has 178834 binaries, 0 generals, 0 SOSs, and 0 indicators. MIP Presolve eliminated 4741 rows and 2406 columns. Reduced MIP has 181240 binaries, 0 generals, 0 SOSs, and 0 indicators. MIP Presolve eliminated 256991 rows and 123355 columns. See below the output when I run my program for a particular instance where this happens Version identifier: 20.1.0.0 | | 9bedb6d68Īggregator has done 6411 substitutions. Could someone tell me how to extract the solution after Dual simplex solved model. However, when CPLEX tries to solve my problem with the dual simplex method it seems to get stuck in the solve method? Hence, it now seems as if for some instances I get feasible solutions and for some instances I do not get any results. I also wrote a solution extractor method, which works most of the time. I am solving a (rather large) MILP in CPLEX in Java.
0 kommentar(er)
