Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
Starting to solve.
Normalizing all Expressions before Transforming the Model...
Normalizing 6956 Constraints...
Normalizing OperatorConstraints...
Normalizing Objectives...
Converting model into native CPLEX model.
Creating and adding 98655 CPLEX INumVars...
Adding objective
Creating and adding 6956 CPLEX IRanges...
Finished conversion to CPLEX API.
CPXPARAM_TimeLimit 300
CPXPARAM_MIP_Tolerances_AbsMIPGap 0
CPXPARAM_MIP_Tolerances_MIPGap 0
CPXPARAM_MIP_Limits_CutsFactor 4
Found incumbent of value 0.000000 after 0.00 sec. (2.51 ticks)
Tried aggregator 2 times.
MIP Presolve eliminated 373 rows and 1485 columns.
MIP Presolve modified 1750 coefficients.
Aggregator did 2 substitutions.
Reduced MIP has 6581 rows, 97168 columns, and 741076 nonzeros.
Reduced MIP has 97168 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 1.56 sec. (597.50 ticks)
Tried aggregator 1 time.
MIP Presolve eliminated 86 rows and 238 columns.
MIP Presolve modified 66 coefficients.
Reduced MIP has 6495 rows, 96930 columns, and 733518 nonzeros.
Reduced MIP has 96930 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 1.51 sec. (426.74 ticks)
Probing time = 0.60 sec. (104.62 ticks)
Clique table members: 421408.
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 32 threads.
Root relaxation solution time = 1.34 sec. (375.58 ticks)
Nodes Cuts/
Node Left Objective IInf Best Integer Best Bound ItCnt Gap
* 0+ 0 0.0000 1.92080e+10 ---
* 0+ 0 1.35547e+09 1.92080e+10 ---
0 0 1.36240e+09 41 1.35547e+09 1.36240e+09 3749 0.51%
* 0+ 0 1.36088e+09 1.36240e+09 0.11%
0 0 1.36230e+09 95 1.36088e+09 Cuts: 104 3902 0.10%
0 0 1.36147e+09 401 1.36088e+09 Cuts: 269 4367 0.04%
0 0 1.36130e+09 2095 1.36088e+09 Cuts: 1096 5703 0.03%
* 0+ 0 1.36097e+09 1.36130e+09 0.02%
0 0 1.36130e+09 2104 1.36097e+09 Cuts: 64 5747 0.02%
0 0 1.36130e+09 2125 1.36097e+09 Cuts: 20 5801 0.02%
* 0+ 0 1.36112e+09 1.36130e+09 0.01%
0 2 1.36130e+09 2125 1.36112e+09 1.36130e+09 5801 0.01%
Elapsed time = 19.08 sec. (7692.03 ticks, tree = 0.01 MB, solutions = 4)
10 10 1.36113e+09 1973 1.36112e+09 1.36130e+09 5965 0.01%
35 27 1.36129e+09 2001 1.36112e+09 1.36130e+09 6331 0.01%
88 53 1.36113e+09 1859 1.36112e+09 1.36130e+09 7056 0.01%
* 135+ 67 1.36112e+09 1.36130e+09 0.01%
135 80 1.36113e+09 1780 1.36112e+09 1.36130e+09 7182 0.01%
* 163+ 56 1.36112e+09 1.36130e+09 0.01%
* 195+ 89 1.36113e+09 1.36130e+09 0.01%
198 132 1.36113e+09 1782 1.36113e+09 1.36130e+09 7810 0.01%
257 92 1.36113e+09 1774 1.36113e+09 1.36130e+09 7207 0.01%
286 199 1.36113e+09 27 1.36113e+09 1.36130e+09 8288 0.01%
309 235 1.36113e+09 1778 1.36113e+09 1.36130e+09 8704 0.01%
358 263 1.36113e+09 1784 1.36113e+09 1.36130e+09 8948 0.01%
780 586 1.36113e+09 29 1.36113e+09 1.36130e+09 10193 0.01%
Elapsed time = 31.01 sec. (10859.46 ticks, tree = 37.13 MB, solutions = 17)
* 1270+ 658 1.36113e+09 1.36130e+09 0.01%
1477 1051 1.36113e+09 31 1.36113e+09 1.36130e+09 15573 0.01%
2169 1545 1.36113e+09 15 1.36113e+09 1.36113e+09 21184 0.00%
3027 1930 1.36113e+09 1781 1.36113e+09 1.36113e+09 25115 0.00%
3885 2645 1.36113e+09 1783 1.36113e+09 1.36113e+09 33335 0.00%
* 4249+ 2452 1.36113e+09 1.36113e+09 0.00%
4761 2916 cutoff 1.36113e+09 1.36113e+09 39128 0.00%
* 4910+ 2757 1.36113e+09 1.36113e+09 0.00%
* 5430+ 3045 1.36113e+09 1.36113e+09 0.00%
5584 3136 1.36113e+09 37 1.36113e+09 1.36113e+09 44462 0.00%
* 5689+ 3135 1.36113e+09 1.36113e+09 0.00%
* 5833+ 3136 1.36113e+09 1.36113e+09 0.00%
6392 3515 infeasible 1.36113e+09 1.36113e+09 49464 0.00%
7310 4034 cutoff 1.36113e+09 1.36113e+09 56466 0.00%
7642 4116 cutoff 1.36113e+09 1.36113e+09 57988 0.00%
7661 4282 1.36113e+09 51 1.36113e+09 1.36113e+09 60438 0.00%
Elapsed time = 68.08 sec. (20592.99 ticks, tree = 540.36 MB, solutions = 28)
* 7668 2918 integral 0 1.36113e+09 1.36113e+09 69353 0.00%
GUB cover cuts applied: 2
Clique cuts applied: 1012
Cover cuts applied: 152
Flow cuts applied: 2
Mixed integer rounding cuts applied: 6
Gomory fractional cuts applied: 1
Root node processing (before b&c):
Real time = 17.91 sec. (7637.04 ticks)
Parallel b&c, 32 threads:
Real time = 83.54 sec. (54004.51 ticks)
Sync time (average) = 19.84 sec.
Wait time (average) = 0.62 sec.
------------
Total (root+branch&cut) = 101.45 sec. (61641.54 ticks)
CPXPARAM_TimeLimit 195.2025683
CPXPARAM_MIP_Tolerances_AbsMIPGap 0
CPXPARAM_MIP_Tolerances_MIPGap 0
CPXPARAM_MIP_Limits_CutsFactor 4
Retaining values of one MIP start for possible repair.
Warning: No solution found from 44 MIP starts.
Tried aggregator 2 times.
MIP Presolve eliminated 368 rows and 1388 columns.
MIP Presolve modified 1674 coefficients.
Aggregator did 2 substitutions.
Reduced MIP has 6587 rows, 97265 columns, and 838869 nonzeros.
Reduced MIP has 97265 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 2.89 sec. (1713.63 ticks)
Tried aggregator 1 time.
MIP Presolve eliminated 85 rows and 224 columns.
MIP Presolve modified 69 coefficients.
Reduced MIP has 6502 rows, 97041 columns, and 831152 nonzeros.
Reduced MIP has 97041 binaries, 0 generals, 0 SOSs, and 0 indicators.
Presolve time = 2.00 sec. (664.06 ticks)
Probing fixed 1 vars, tightened 0 bounds.
Probing time = 0.60 sec. (124.14 ticks)
Clique table members: 470282.
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 32 threads.
Root relaxation solution time = 1.69 sec. (516.09 ticks)
Nodes Cuts/
Node Left Objective IInf Best Integer Best Bound ItCnt Gap
0 0 2.9638 36 2.9638 5848
0 0 3.5016 115 Cuts: 104 6012
0 0 3.8063 109 Cuts: 168 6139
0 0 4.1355 128 Cuts: 38 6224
0 0 4.2501 148 Cuts: 39 6285
0 0 4.8671 160 Cuts: 79 6407
0 0 21.8989 145 Cuts: 34 7109
0 0 23.7712 155 Cuts: 14 7222
0 0 24.3617 168 Cuts: 27 7278
0 0 24.4089 165 Cuts: 24 7319
0 0 24.4197 180 Cuts: 21 7374
0 0 24.5335 193 Cuts: 18 7416
0 0 24.5566 193 Cuts: 14 7442
0 0 24.5600 185 Cuts: 15 7471
0 0 24.6058 199 Cuts: 12 7513
0 0 24.6060 208 Cuts: 14 7538
0 0 24.6077 211 Cuts: 15 7562
Repair heuristic found nothing.
0 2 24.6077 211 24.6077 7562
Elapsed time = 41.89 sec. (18739.24 ticks, tree = 0.01 MB, solutions = 0)
15 13 25.0437 201 24.6106 7598
43 38 24.8599 200 24.6106 7728
83 67 25.2184 198 24.6106 8161
139 113 25.5023 193 24.6485 9167
179 165 24.7528 200 24.6572 10625
210 208 24.9009 202 24.6572 13101
242 229 24.6655 210 24.6572 13657
294 272 24.8454 196 24.6572 14594
343 242 infeasible 24.6572 17026
410 356 33.3794 62 24.6667 24665
Elapsed time = 53.05 sec. (21922.80 ticks, tree = 17.81 MB, solutions = 0)
502 458 33.4394 59 24.6667 74087
619 552 33.9770 47 24.6667 89240
748 670 33.9624 45 24.6667 107975
790 459 36.8221 47 24.6667 77130
810 561 36.6974 51 24.6667 93015
860 671 49.7300 53 24.6667 112090
901 771 33.3259 64 24.6667 171832
948 822 38.7841 46 24.6667 202808
1041 857 38.5314 50 24.6667 223381
1140 895 41.3540 58 24.6667 228210
Elapsed time = 86.05 sec. (31616.27 ticks, tree = 47.50 MB, solutions = 0)
1247 981 39.4960 46 24.6667 250877
1462 1068 39.5106 46 24.6667 264110
1610 1185 43.2281 53 24.6667 275839
1835 1291 43.1783 43 24.6667 294817
1994 1488 38.8943 47 24.6667 316531
2154 1528 infeasible 24.6667 322444
2289 1627 39.9404 42 24.6667 328400
2460 1665 44.6608 43 24.6667 334089
2676 2018 43.8228 53 24.6667 368179
2936 2154 38.9044 46 24.6726 391023
Elapsed time = 124.83 sec. (41229.60 ticks, tree = 168.90 MB, solutions = 0)
3108 2176 38.8612 45 24.6726 391327
3266 2205 38.9602 45 24.6726 392011
3406 2400 44.8890 42 24.6726 445156
3539 2491 40.3412 48 24.6726 469703
3650 2576 39.5691 29 24.7094 513042
3794 2605 34.1958 42 24.7094 538019
3928 2693 44.3904 21 24.7094 568959
4112 2774 infeasible 24.7094 594480
4319 2918 45.3635 33 24.7094 632977
4600 2868 45.0211 19 24.7094 623531
Elapsed time = 164.40 sec. (50835.61 ticks, tree = 263.48 MB, solutions = 0)
4777 2590 infeasible 24.7144 539746
4916 3510 43.4212 23 24.7144 739369
5041 3437 45.7237 35 24.7144 710167
5137 3589 43.3502 31 24.7144 764175
5336 3678 44.5439 27 24.7395 807478
5511 3710 43.5058 21 24.7395 815209
5772 3716 45.2645 28 24.7395 857209
5987 3965 43.8367 37 24.7395 900010
6084 4040 infeasible 24.7395 915529
6088 3720 38.7045 23 24.7395 821919
Elapsed time = 195.44 sec. (60839.21 ticks, tree = 525.70 MB, solutions = 0)
GUB cover cuts applied: 7
Clique cuts applied: 130
Cover cuts applied: 65
Flow cuts applied: 13
Mixed integer rounding cuts applied: 50
Zero-half cuts applied: 6
Gomory fractional cuts applied: 5
Root node processing (before b&c):
Real time = 40.66 sec. (18568.83 ticks)
Parallel b&c, 32 threads:
Real time = 154.93 sec. (43274.39 ticks)
Sync time (average) = 75.51 sec.
Wait time (average) = 0.47 sec.
------------
Total (root+branch&cut) = 195.59 sec. (61843.22 ticks)
The solver raised an unexpected exception.
Type: System.NullReferenceException
Message: Object reference not set to an instance of an object.
Properties:
HResult: 0x80004003
Source: optano.modeling
Stack Trace:
at OPTANO.Modeling.Optimization.SolverBase.ComputeAndStoreAllObjectiveValues(Solution intermediateSolution)
at OPTANO.Modeling.Optimization.SolverBase.FinishNonNativeSolve(Solution intermediateSolution, List`1 toleranceConstraints, Int64 totalNodeCount, Dictionary`2 prioToMergedName, Dictionary`2 priorityLevelToFinalGap, Boolean wasTimeout, Boolean userInterruptedSolve)
at OPTANO.Modeling.Optimization.SolverBase.SolveNonNative(Dictionary`2 variableValues, Boolean isResolve)
at OPTANO.Modeling.Optimization.SolverBase.Solve(Model model, Dictionary`2 variableValues)
at Flips.Optano.cplex128Solve(SolverSettings settings, Model optanoModel) in C:\Users\matth\source\repos\flips\Flips\Solve.fs:line 345
at Flips.Optano.solve(OptanoSolverType solverType, SolverSettings settings, Model model) in C:\Users\matth\source\repos\flips\Flips\Solve.fs:line 361
at Flips.Solver.solve(SolverSettings settings, Model model) in C:\Users\matth\source\repos\flips\Flips\Solve.fs:line 388
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment